The solvability problem for quadratic equations over free groups is NP-complete

O. Kharlampovich, I. G. Lysënok, A. G. Myasnikov, N. W.M. Touikan

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

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

Original languageEnglish
Pages (from-to)250-258
Number of pages9
JournalMathematical Systems Theory
Volume47
Issue number1
DOIs
StatePublished - Jul 2010

Keywords

  • Equations over free groups
  • NP-completeness

Fingerprint

Dive into the research topics of 'The solvability problem for quadratic equations over free groups is NP-complete'. Together they form a unique fingerprint.

Cite this