Satisfiability of equations in free groups is in PSPACE

@inproceedings{Gutirrez2000SatisfiabilityOE,
  title={Satisfiability of equations in free groups is in PSPACE},
  author={Claudio Guti{\'e}rrez},
  booktitle={STOC},
  year={2000}
}
ABSTRACT We prove that the computational complexity of the problem of deciding if an equation in a free group has a solution is PSPACE. The problem was proved decidable in 1982 by Makanin, whose algorithm was proved later to be non primitive recursive: this was the best upper bound known for this problem. Our proof consists in reducing equations in free groups to equations in free semigroups with antiinvolution, and presenting an algorithm for deciding equations in free semigroups with… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Makanin's Algorithm is not Primitive Recursive

Theor. Comput. Sci. • 1998
View 5 Excerpts
Highly Influenced

Equations in a free group, Izvestiya NA SSSR 46(1982)

G. S. Makanin
English translation in Math USSR Izvestiya, • 1983
View 4 Excerpts
Highly Influenced

Systems of equations in a free group I, Izv

Y. I. Kmelevskii
Akad. Nauk. SSSR Ser. Mat. 35(1971), • 1971
View 6 Excerpts
Highly Influenced

On systems of equations in a free group, Izvestiya AN SSSR

A. A. Razborov
(in Russian). En- glish translation in Math. USSR Izvestiya • 1984
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…