Group with nondeterministic polynomial-time solvable word problem

Definition
A group with nondeterministic polynomial-time solvable word problem is a finitely generated group such that for one (and hence every) word in terms of the generators, the word problem can be solved using a nondeterministic polynomial-time algorithm.