Theory of Computing Systems

, Volume 47, Issue 1, pp 250–258

The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete

Authors

  • O. Kharlampovich
    • McGill University
  • I. G. Lysënok
    • Steklov Institute
  • A. G. Myasnikov
    • McGill University
    • McGill University
Article

DOI: 10.1007/s00224-008-9153-7

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

Abstract

We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.

Keywords

Equations over free groupsNP-completeness
Download to read the full article text

Copyright information

© Springer Science+Business Media, LLC 2008