The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete
- First Online:
- Cite this article as:
- Kharlampovich, O., Lysënok, I.G., Myasnikov, A.G. et al. Theory Comput Syst (2010) 47: 250. doi:10.1007/s00224-008-9153-7
- 130 Downloads
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
KeywordsEquations over free groups NP-completeness
© Springer Science+Business Media, LLC 2008