Complexity of some algorithmic problems in groups: a survey
Abstract: In this survey, we address the worst-case, average-case, and generic-case time complexity of the word problem and some other algorithmic problems in several classes of groups and show that it is often the case that the average-case complexity of the word problem is linear with respect to the length of an input word, which is as good as it gets if one considers groups given by generators and defining relations. At the same time, there are other natural algorithmic problems, for instance, the geodesic (decision) problem or Whitehead's automorphism problem, where the average-case time complexity can be sublinear, even constant.
- H. A. Helfgott,Growth and generation in SL2(ℤ/pℤSL_{2}(\mathbb{Z}/p\mathbb{Z}italic_S italic_L start_POSTSUBSCRIPT 2 end_POSTSUBSCRIPT ( blackboard_Z / italic_p blackboard_Z) Ann. of Math. (2) 167 (2008), 601–623.
- R. Lyndon and P. Schupp, Combinatorial Group Theory, Springer-Verlag, 1977. Reprinted in the “Classics in mathematics” series, 2000.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
