Quadratic equations over free groups are NP-complete
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
math.GR↗
arXiv subjects
Publications and source records attributed to A. G Myasnikov.
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.