Abstract
A powerfull tool for solving algorithmic problems in free groups is the concept of Nielsen reduction. Since the Nielsen reduction can be done in polynomial time, many problems such as the generalized word problem, the equality and the isomorphism problem for subgroups are solvable in polynomial time. Even more, we show that these problems are P — complete under log-space reducibility.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Avenhaus, J., Madlener, K.: Polynomial time algorithms for the Nielsen reduction and related problems, Interner Bericht, 1980 FB Informatik, Univ. Kaiserslautern
Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time, Theor. Comp. Sci. 3 (1977) 105–117
Lipton, R.J., Zalcstein, Y.: Word problems solvable in logspace, Journ. ACM, 24 (1977) 522–526
Lyndon, R.C., Schupp, P.E.: Combinatorial group theory, Springer, Berlin 1977
Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory, New York 1966
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avenhaus, J., Madlener, K. (1981). P — complete problems in free groups. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017295
Download citation
DOI: https://doi.org/10.1007/BFb0017295
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive