Michael Figelius

Orcid: 0000-0002-0407-0597

According to our database1, Michael Figelius authored at least 4 papers between 2020 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems.
ACM Trans. Comput. Theory, December, 2022

Exponent Equations in HNN-extensions.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2020
The Complexity of Knapsack Problems in Wreath Products.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems.
Proceedings of the 35th Computational Complexity Conference, 2020


  Loading...