Asymptotic invariants, complexity of groups and related problems
Mark Sapir
TL;DR
This paper surveys the computational complexity of the word problem in groups, Dehn functions, and related problems, providing an overview of key results and open questions in the field.
Contribution
It offers a comprehensive overview of the current state of research on asymptotic invariants and complexity issues in group theory.
Findings
Summarizes known complexity classifications of the word problem
Highlights open problems in Dehn functions and related invariants
Provides insights into the relationship between group invariants and computational complexity
Abstract
We survey results about computational complexity of the word problem in groups, Dehn functions of groups and related problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.