Preliminaries from Combinatorial Group Theory
Publisher
Springer New York
Reference44 articles.
1. J. Avenhaus, K. Madlener, Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Archiv für Mathematische Logik und Grundlagenforschung 19(1–2), 3–12 (1978/79)
2. G. Baumslag, A non-cyclic one-relator group all of whose finite quotients are cyclic. J. Austr. Math. Soc. Ser. A. Pure Math. Stat. 10, 497–498 (1969)
3. J.-C. Birget, A.Y. Ol’shanskii, E. Rips, M.V. Sapir, Isoperimetric functions of groups and computational complexity of the word problem. Ann. Math. Sec. Ser. 156(2), 467–518 (2002)
4. A. Björner, F. Brenti, Combinatorics of Coxeter Groups. Graduate Texts in Mathematics, vol. 231 (Springer, New York, 2005)
5. W.W. Boone, The word problem. Ann. Math. Sec. Ser. 70, 207–265 (1959)