Abstract
We give lower bounds on the complexity of the word problem for a large class of non-solvable infinite groups that we call strongly efficiently non-solvable groups. This class includes free groups, Grigorchuk’s group, and Thompson’s groups. We prove that these groups have an NC1-hard word problem and that for some of them (including Grigorchuk’s group and Thompson’s groups) the compressed word problem (which is equivalent to the circuit evaluation problem) is PSPACE-complete.
- [1] . 2005. Group laws and free subgroups in topological groups. Bull. Lond. Math. Soc. 37, 4 (2005), 525–534.
DOI: Google ScholarCross Ref
- [2] . 2013. The virtual Haken conjecture. Doc. Math. 18 (2013), 1045–1087.Google Scholar
Cross Ref
- [3] . 2009. Computational Complexity—A Modern Approach. Cambridge University Press.Google Scholar
Cross Ref
- [4] . 1989. Bounded-width polynomial-size branching programs recognize exactly those languages in \({NC}^1\). J. Comput. Syst. Sci. 38, 1 (1989), 150–164.
DOI: Google ScholarDigital Library
- [5] . 1988. Finite monoids and the fine structure of \(NC^{1}\). J. ACM 35 (1988), 941–952.Google Scholar
Digital Library
- [6] . 2020. Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems. In Proceedings of the 35th Computational Complexity Conference (CCC’20),
LIPIcs , Vol. 169, (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 29:1–29:29.DOI: Google ScholarDigital Library
- [7] . 2003. Branch groups. In Handbook of Algebra, Vol. 3. Elsevier/North-Holland, Amsterdam, 989–1112.
DOI: Google ScholarCross Ref
- [8] . 2008. Iterated monodromy groups of quadratic polynomials. I. Groups Geom. Dynam. 2, 3 (2008), 309–336.
DOI: Google ScholarCross Ref
- [9] . 1997. Finite Monoids: From word to circuit evaluation. SIAM J. Comput. 26, 1 (1997), 138–152.Google Scholar
Digital Library
- [10] . 1992. Counting classes: Thresholds, parity, mods, and fewness. Theor. Comput. Sci. 103, 1 (1992), 3–23.
DOI: Google ScholarDigital Library
- [11] . 1959. The word problem. Ann. Math. 70, 2 (1959), 207–265.Google Scholar
- [12] . 1992. A uniform approach to define complexity classes. Theor. Comput. Sci. 104, 2 (1992), 263–283.Google Scholar
Digital Library
- [13] . 1996. Introductory notes on Richard Thompson’s groups. L’Enseign. Math. 42, 3 (1996), 215–256.Google Scholar
- [14] . 1998. Nondeterministic NC\({}^{1}\) computation. J. Comput. Syst. Sci. 57, 2 (1998), 200–212.
DOI: Google ScholarDigital Library
- [15] . 2005. The smallest grammar problem. IEEE Trans. Inf. Theory 51, 7 (2005), 2554–2576.Google Scholar
Digital Library
- [16] . 1911. Über unendliche diskontinuierliche Gruppen. Math. Ann. 71, 1 (1911), 116–144. MAANA
DOI: Google ScholarCross Ref
- [17] . 2020. The complexity of knapsack problems in wreath products. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP’20). 126:1–126:18.
DOI: Google ScholarCross Ref
- [18] . 2019. A universal tree balancing theorem. ACM Trans. Comput. Theory 11, 1 (2019), 1:1–1:25.Google Scholar
Digital Library
- [19] . 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman.Google Scholar
Digital Library
- [20] . 1991. The complexity of Grigorchuk groups with application to cryptography. Theor. Comput. Sci. 88, 1 (1991), 83–98.Google Scholar
Digital Library
- [21] . 1980. On Burnside’s problem on periodic groups. Funkts. Anal. Prilozhen. 14, 1 (1980), 53–54. Google Scholar
- [22] . 2006. Asymptotic aspects of Schreier graphs and Hanoi Towers groups. C. R. Math. Acad. Sci. Paris 342, 8 (2006), 545–550.
DOI: Google ScholarCross Ref
- [23] . 1999. On subgroups of the R. Thompson group \(F\) and other diagram groups. Mat. Sb. 190, 8 (1999), 3–60.
DOI: Google ScholarCross Ref
- [24] . 1983. On the Burnside problem for periodic groups. Math. Z. 182, 3 (1983), 385–388.
DOI: Google ScholarCross Ref
- [25] . 2010. Coxeter groups are virtually special. Adv. Math. 224, 5 (2010), 1890–1903.Google Scholar
Cross Ref
- [26] . 1990. Relations among MOD-classes. Theor. Comput. Sci. 74, 3 (1990), 325–328.
DOI: Google ScholarDigital Library
- [27] . 1994. Über Komplexitätsklassen, die mit Hilfe von k-wertigen Funktionen definiert werden. Habilitationsschrift. Universität Würzburg.Google Scholar
- [28] . 1997. The shapes of trees. In Proceedings of the 3rd Annual International Conference on Computing and Combinatorics (COCOON’97),
Lecture Notes in Computer Science , Vol. 1276. Springer, 412–421.Google ScholarCross Ref
- [29] . 2000. Algebraic acceptance mechanisms for polynomial time machines. SIGACT News 31, 2 (2000), 22–33.
DOI: Google ScholarDigital Library
- [30] . 1993. On the power of polynomial time bit-reductions. In Proceedings of the 8th Annual Structure in Complexity Theory Conference. IEEE Computer Society Press, 200–207.Google Scholar
Cross Ref
- [31] . 1996. On balanced versus unbalanced computation trees. Math. Syst. Theory 29, 4 (1996), 411–421.Google Scholar
Cross Ref
- [32] . 1994. A polynomial-time algorithm for deciding equivalence of normed context-free processes. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS’94). IEEE Computer Society, 623–631.
DOI: Google ScholarDigital Library
- [33] . 2020. The compressed word problem in relatively hyperbolic groups. Journal of Algebra 607 (2022), 305–343. Google Scholar
Cross Ref
- [34] . 2019. Compressed decision problems in hyperbolic groups. In Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS’19),
LIPIcs , Vol. 126. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 37:1–37:16.Google Scholar - [35] . 2017. Groups, Languages and Automata.
London Mathematical Society Student Texts , Vol. 88. Cambridge University Press.DOI: Google ScholarCross Ref
- [36] . 1996. Logspace and logtime leaf languages. Inf. Comput. 129, 1 (1996), 21–33.Google Scholar
Digital Library
- [37] . 1989. The iterated mod problem. Inf. Comput. 80, 3 (1989), 193–204.Google Scholar
Digital Library
- [38] . 2018. Evaluation of circuits over nilpotent and polycyclic groups. Algorithmica 80, 5 (2018), 1459–1492.Google Scholar
Digital Library
- [39] . 2018. Parallel identity testing for skew circuits with big powers and applications. Int. J. Arch. Comput. 28, 6 (2018), 979–1004.Google Scholar
Cross Ref
- [40] . 2007. The co-word problem for the Higman-Thompson group is context-free. Bull. Lond. Math. Soc. 39, 2 (
02 2007), 235–241.DOI: Google ScholarCross Ref
- [41] . 2010. The Ore conjecture. J. Eur. Math. Soc. 12, 4 (2010), 939–1008.
DOI: Google ScholarCross Ref
- [42] . 2006. Querying and embedding compressed texts. In Proceedings of the 31th International Symposium on Mathematical Foundations of Computer Science (MFCS’06),
Lecture Notes in Computer Science , Vol. 4162. Springer, 681–692.Google ScholarDigital Library
- [43] . 1977. Word problems solvable in logspace. J. Assoc. Comput. Mach. 24, 3 (1977), 522–526.Google Scholar
Digital Library
- [44] . 2006. Word problems and membership problems on compressed words. SIAM J. Comput. 35, 5 (2006), 1210–1240.Google Scholar
Digital Library
- [45] . 2011. Leaf languages and string compression. Inf. Comput. 209, 6 (2011), 951–965.Google Scholar
Digital Library
- [46] . 2014. The Compressed Word Problem for Groups. Springer.
DOI: Google ScholarCross Ref
- [47] . 2013. Isomorphism of regular trees and words. Inf. Comput. 224 (2013), 71–105.Google Scholar
Digital Library
- [48] . 2019. The power word problem. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS’19),
LIPIcs , Vol. 138. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 43:1–43:15.Google Scholar - [49] . 1965. Memory bounds for recognition of context-free and context-sensitive languages. In Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design. IEEE Computer Society, 191–202.Google Scholar
- [50] . 1994. Maintaining dynamic sequences under equality-tests in polylogarithmic time. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’94). ACM/SIAM, 213–222. http://dl.acm.org/citation.cfm?id=314464.314496.Google Scholar
- [51] . 2005. Self-similar Groups.
Mathematical Surveys and Monographs , Vol. 117. American Mathematical Society, Providence, RI.DOI: Google ScholarCross Ref
- [52] . 1955. On the algorithmic unsolvability of the word problem in group theory. Trudy Mat. Inst. Steklov (1955), 1–143.Google Scholar
- [53] . 1994. Testing equivalence of morphisms on context-free languages. In Proceedings of the Second Annual European Symposium on Algorithms (ESA’94),
Lecture Notes in Computer Science , Vol. 855. Springer, 460–470.DOI: Google ScholarCross Ref
- [54] . 1993. Parallel Algorithms for Group Word Problems. Ph. D. Dissertation. University of California, San Diego.Google Scholar
Digital Library
- [55] . 1995. An Introduction to the Theory of Groups (4th ed.). Springer.Google Scholar
Cross Ref
- [56] . 2010. Arithmetic circuits: A survey of recent results and open questions. Found. Trends Theor. Comput. Sci. 5, 3-4 (2010), 207–388.
DOI: Google ScholarDigital Library
- [57] . 1979. Word problems for groups and contextfree recognition. In Proceedings of the International Symposium on Fundamentals of Computation Theory (FCT’79). Akademie-Verlag, 417–422.Google Scholar
- [58] . 1987. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing. 77–82.
DOI: Google ScholarDigital Library
- [59] . 1972. Free subgroups in linear groups. J. Algebr. 20, 2 (1972), 250–270.Google Scholar
Cross Ref
- [60] . 1999. Introduction to Circuit Complexity. Springer, Berlin.Google Scholar
Digital Library
- [61] . 1990. The parallel complexity of some constructions in combinatorial group theory. J. Inf. Process. Cybernet. EIK 26 (1990), 265–281.Google Scholar
- [62] . 2020. An automaton group with PSPACE-complete word problem. In Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS’20). Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 6:1–6:17.
DOI: Google ScholarCross Ref
- [63] . 1980. Embedding theorems for residually finite groups. Math. Z. 174, 2 (1980), 149–157.
DOI: Google ScholarCross Ref
- [64] . 2009. Research announcement: The structure of groups with a quasiconvex hierarchy. Electr. Res. Announce. Math. Sci. 16 (2009), 44–55.Google Scholar
Cross Ref
Index Terms
Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems
Recommendations
Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems
CCC '20: Proceedings of the 35th Computational Complexity ConferenceWe give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their word problem ...
Groups with a recursively enumerable irreducible word problem
FCT'13: Proceedings of the 19th international conference on Fundamentals of Computation TheoryThe notion of the word problem is of fundamental importance in group theory. The irreducible word problem is a closely related concept and has been studied in a number of situations; however there appears to be little known in the case where a finitely ...
An Automaton Group with PSPACE-Complete Word Problem
AbstractWe construct an automaton group with a PSPACE-complete word problem, proving a conjecture due to Steinberg. Additionally, the constructed group has a provably more difficult, namely EXPSPACE-complete, compressed word problem and acts over a binary ...






Comments