Abstract
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
Similar content being viewed by others
References
Comerford, L.P., Jr., Edmunds, C.C.: Quadratic equations over free groups and free products. J. Algebra 68(2), 276–297 (1981)
Diekert, V., Robson, J.M.: Quadratic word equations. In: Jewels Are Forever, pp. 314–326. Springer, Berlin (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences. Freeman, New York (1979)
Grigorchuk, R.I., Kurchanov, P.F.: On quadratic equations in free groups. In: Proceedings of the International Conference on Algebra, Part 1 (Novosibirsk, 1989). Contemp. Math., vol. 131, pp. 159–171. Amer. Math. Soc., Providence (1989)
Grigorchuk, R.I., Lysionok, I.G.: A description of solutions of quadratic equations in hyperbolic groups. Int. J. Algebra Comput. 2(3), 237–274 (1992)
Mal’cev, A.I.: On the equation zxyx −1 y −1 z −1=aba −1 b −1 in a free group. Algebra Log. Sem. 1(5), 45–50 (1962)
McCammond, J.P., Wise, D.T.: Fans and ladders in small cancellation theory. Proc. Lond. Math. Soc. (3) 84(3), 599–644 (2002)
Ol’shanskiĭ, A.Yu.: Diagrams of homomorphisms of surface groups. Sib. Mat. Z. 30(6), 150–171 (1989)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kharlampovich, O., Lysënok, I.G., Myasnikov, A.G. et al. The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete. Theory Comput Syst 47, 250–258 (2010). https://doi.org/10.1007/s00224-008-9153-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-008-9153-7