Isoperimetric Functions of Groups and Computational Complexity of the Word Problem
Birget, J. -C. · Olshanskii, A. Yu. · Rips, E. · Sapir, M.
Original · EN
We prove that the word problem of a finitely generated group G is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group H with polynomial isoperimetric function. The embedding can be chosen in such a way that G has bounded distortion in H.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.