TL;DR
This paper explores the relationship between the geometric properties of groups, specifically space functions, and the computational complexity of solving the word problem within those groups.
Contribution
It establishes a connection between the space functions of groups and the space complexity of their word problems, providing new insights into geometric group theory and computational complexity.
Findings
Identifies how space functions influence the complexity of the word problem
Provides bounds relating group properties to algorithmic space complexity
Enhances understanding of geometric and computational aspects of groups
Abstract
We study the interrelation of space functions of groups and the space complexity of the algorithmic word problem in groups.
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.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Coding theory and cryptography