Complexity of Some Algorithmic Problems in Groups: A Survey
Vladimir Shpilrain · 2024
In this survey, we address the worst-, average-, 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 complexity can be sublinear, even constant.