Isoperimetric Functions of Groups and Computational Complexity of the Word Problem
Group Theory
2007-05-23 v1
Abstract
We prove that the word problem of a finitely generated group 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 with polynomial isoperimetric function. The embedding can be chosen in such a way that has bounded distortion in .
Cite
@article{arxiv.math/9811106,
title = {Isoperimetric Functions of Groups and Computational Complexity of the Word Problem},
author = {J. -C. Birget and A. Yu. Olshanskii and E. Rips and M. Sapir},
journal= {arXiv preprint arXiv:math/9811106},
year = {2007}
}
Comments
47 pages