Isoperimetric Functions of Groups and Computational Complexity of the Word Problem

J. -C. Birget, A. Yu. Olshanskii, E. Rips +1

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 subgrou…