Average-case complexity and decision problems in group theory

Advances in Mathematics

Volumn 190, Issue 2, 2005, Pages 343-359

  Kapovich, Ilya ^a   Myasnikov, Alexei ^b   Schupp, Paul ^a   Shpilrain, Vladimir ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b CITY COLLEGE OF NEW YORK   (United States)

Author keywords

Average case complexity; Decision problems; Finitely presented groups; Generic case complexity

Indexed keywords

EID: 6944252026     PISSN: 00018708     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aim.2003.02.001     Document Type: Article

References (64)

1. Adian S.I. Durnev V.G. Algorithmic problems for groups and semigroups Usp. Mat. Nauk. 55 2 2000 3-94
2. Adian S.I. Durnev V.G. Trans. Russian Math. Surveys 55 2 2000 207-296
3. Alonso J. Brady T. Cooper D. Ferlini V. Lustig M. Mihalik M. Shapiro M. Short H. Notes on hyperbolic groups, in: É. Ghys, A. Haefliger, A. Verjovsky (Eds.), Group Theory from a Geometrical Viewpoint, Proceedings of the Workshop held in Trieste, World Scientific Publishing Co., Singapore, 1991.
4. Anshel M. Domanski B. The complexity of Dehn's algorithm for word problems in groups J. Algorithms 6 4 1985 543-549
5. Appel K. Schupp P. Coxeter groups, Artin groups and small cancellation theory Invent. Math. 72 2 1983 201-220
6. Arzhantseva G. On groups in which subgroups with a fixed number of generators are free Fund. Prikl. Mat. 3 3 1997 675-683 (in Russian)
7. Arzhantseva G. Generic properties of finitely presented groups and Howson's theorem Comm. Algebra 26 11 1998 3783-3792
8. Arzhantseva G. A property of subgroups of infinite index in a free group Proc. Amer. Math. Soc. 128 11 2000 3205-3210
9. Arzhantseva G. Olshanskii A. Genericity of the class of groups in which subgroups with a lesser number of generators are free Mat. Zametki 59 4 1996 489-496 (in Russian)
10. Bartholdi L. Counting paths in graphs Enseign. Math. (2) 45 1-2 1999 83-131
11. Baumslag B. Pride S.J. Groups with two more generators than relators J. London Math. Soc. (2) 17 3 1978 425-426
12. Baumslag G. Gersten S.M. Shapiro M. Short H. Automatic groups and amalgams J. Pure Appl. Algebra 76 3 1991 229-316
13. Baumslag G. Miller III C.F. Experimenting and computing with infinite groups. Groups and Computation, II, New Brunswick, NJ, 1995, pp. 19-30
14. Baumslag G. Miller III C.F. (Eds.), Discrete Mathematical Theoretical Computer Science Series, Vol. 28, American Mathematical Society, Providence, RI, 1997.
15. Benedetti R. Petronio C. Lectures on Hyperbolic Geometry, Universitext 1992 Springer Berlin
16. Brovik A. Myasnikov A.G. Shpilrain V. Measuring sets in infinite groups, Contemporary Mathematics, Computational and Statistical Group Theory, Las Vegas, NV/Hoboken, NJ, 2001, pp. 21-42
17. Borovik A. Myasnikov A.G. Shpilrain V. (Eds.), Contemporary Mathematics, Vol. 298, American Mathematical Society, Providence, RI, 2002.
18. Brink B. Howlett R. A finiteness property and an automatic structure for Coxeter groups Math. Ann. 296 1 1993 179-190
19. Ceccherini-Silberstein T. Grigorchuck R. de la Harpe P. Amenability and paradoxical decompositions for pseudogroups and discrete metric spaces Tr. Mat. Inst. Steklova 1999 224 (in russian)
20. Ceccherini-Silberstein T. Grigorchuck R. de la Harpe P. Algebra. Topol. Differ. Uravn. i ikh Prilozh 68-111
21. Ceccherini-Silberstein T. Grigorchuck R. de la Harpe P. Proc. Steklov Inst. Math. 224 1 1999 57-97
22. Champetier C. Petite simplification dans les groupes hyperboliques Ann. Fac. Sci. Toulouse Math. (6) 3 2 1994 161-221
23. Champetier C. Propriétés statistiques des groupes de présentation finie Adv. Math. 116 2 1995 197-262
24. Champetier C. The space of finitely generated groups Topology 39 4 2000 657-680
25. Cherix P.-A. Valette A. On spectra of simple random walks on one-relator groups With an appendix by Paul Jolissaint. Pacific J. Math. 175 2 1996 417-438
26. Cherix P.-A. Schaeffer G. An asymptotic Freiheitssatz for finitely generated groups Enseign. Math. (2) 44 1-2 1998 9-22
27. Cohen J.M. Cogrowth and amenability of discrete groups J. Funct. Anal. 48 1982 301-309
28. Coornaert M. Delzant T. Papadopoulos A. Géométrie et théorie des groupes. Les groupes hyperboliques de Gromov Lecture Notes in Mathematics Vol. 1441 1990 Springer Berlin
29. Epstein D. Cannon J. Holt D. Levy S. Paterson M. Thurston W. Word Processing in Groups 1992 Jones and Bartlett Boston
30. Farb B. Automatic groups: a guided tour Enseign. Math. (2) 38 3-4 1992 291-313
31. Gersten S. Introduction to hyperbolic and automatic groups, Summer School Groups Theory in Banff, 1996, pp. 45-70
32. Gersten S. CRM Proceedings Lecture Notes, Vol. 17, American Mathematical Society, Providence, RI, 1999.
33. Gersten S. Short H. Rational subgroups of bi-automatic groups Ann. Math. (2) 134 1 1991 125-158
34. Ghys E. Groupes Aléatoires, Seminar Bourbaki, to appear in Asterisque.
35. Ghys E. de la Harpe P. (Eds.), Sur les groupes hyperboliques d'aprés Mikhael Gromov, Progress in Mathematics Series, Vol. 83, Birkhäuser, 1990.
36. Gilman R. Groups with a rational cross-section, Combinational group theory and topology, Alta, Utah, 1984, pp. 175-183
37. Gilman R. Annals of Mathematical Studies, Vol. 111, Princeton University Press, Princeton, NJ, 1987.
38. Grigorchuk R. Symmetrical random walks on discrete groups, Multicomponent random systems, Advances in Probability Related Topics, Vol. 6, Dekker, New York, 1980, pp. 285-325.
39. Gromov M. Hyperbolic Groups, Essays in Group Theory, Springer, New York, 1987, pp. 75-263.
40. Gromov M. Random walks in random groups Geom. Funct. Anal. 13 1 2003 73-146
41. Gromov M. Asymptotic Invariants of Infinite Groups, Geometric Group Theory, Vol. 2, Sussex, 1991, Cambridge University Press, Cambridge, 1993, pp. 1-295.
42. Holt D. Word-hyperbolic groups have real-time word problem Internat. J. Algebra Comput. 10 2 2000 221-227
43. Kapovich I. The non-amenability of Schreier graphs for infinite index quasiconvex subgroups of hyperbolic groups Enseign. Math. 48 3-4 2002 359-375
44. Kapovich I. Myasnikov A. Shpilrain V. Schupp P.E. Generic-case complexity and decision problems in group theory and random walks J. Algebra 264 2 2003 665-694
45. IKapovich I. Schupp P. Genericity, the Arzhantseva-Ol'shanskii method and the isomorphism problem for one-relator groups, preprint, 2002; http://front.math.ucdavis.edu/math.GR/0210307
46. k) and one-relator groups, preprint, 2003; http://front.math.ucdavis.edu/math.GR/0303386
47. Levin L. Average case complete problems SIAM J. Comput. 15 1986 285-286
48. Lipton R. Zalcstein Y. Word problems solvable in logspace J. Assoc. Comput. Mach. 24 3 1977 522-526
49. Lyndon R.C. Schupp P.E. Combinatorial Group Theory, Ergebnisse der Mathematik, band 89, Springer, Berlin, 1977; Reprinted in the Springer Classics in Mathematics Series, 2000.
50. Miller III C.F. Decision problems for groups, Survey and reflections In: Bamuslag G. Miller III C.F. (Eds.) Algorithms and Classification in Combinatorial Group Theory 1992 1-60 Springer Berlin
51. Ollivier Y. Critical densities for random quotients of hyperbolic groups C. R. Math. Acad. Sci. Paris 336 5 2003 391-394
52. Ol'shanskii A.Yu. Almost every group is hyperbolic Internat. J. Algebra Comput. 2 1 1992 1-17
53. Papadimitriou C. Computation Complexity 1994 Addison-Wesley Reading, MA
54. Peifer D. Artin groups of extra-large type are biautomatic J. Pure Appl. Algebra 110 1 1996 15-56
55. Short H. An introduction to automatic groups, Semigroups formal languages and groups, York, Publishers, Dordrecht, 1995.
56. Short H. NATO Advanced Science Institution Series C Math. Phys. Sci., Vol. 466, Kluwer Academic Publishers, Dordrecht, 1995.
57. Vershik A.M. Dynamic theory of growth in groups: entropy, boundaries, examples, Usp. Mat. Nauk 55 4 2000 334 59-128
58. Vershik A.M. Transl. Russian Math. Surveys 55 4 2000 667-733
59. Wang J. Average-case completeness of a word problem in groups, Proceedings of the 27th Annual Symposium on Theory of Computing, ACM Press, New York, 1995, pp. 325-334.
60. Wang J. Average-case computational complexity theory, Complexity Theory Retrospective, II. Springer, New York, 1997, pp. 295-334.
61. Wang J. Distributional word problem for groups SIAM J. Comput. 28 4 1999 1264-1283
62. Woess W. Cogrowth of groups and simple random walks Arch. Math. 41 1983 363-370
63. Woess W. Random walks on infinite graphs and groups-a survey on selected topics Bull. London Math. Soc. 26 1994 1-60
64. Zuk A. On property (T) for discrete groups, Rigidity in Dynamics and Geometry, (Cambridge, 2000), Springer, Berlin, 2002, pp. 473-482.