Circuits, coNP-completeness, and the groups of Richard Thompson
Group Theory
2007-05-23 v1
Abstract
We construct a finitely presented group with coNP-complete word problem, and a finitely generated simple group with coNP-complete word problem. These groups are represented as Thompson groups, hence as partial transformation groups of strings. The proof provides a simulation of combinational circuits by elements of the Thompson-Higman group G_{3,1}.
Cite
@article{arxiv.math/0310335,
title = {Circuits, coNP-completeness, and the groups of Richard Thompson},
author = {Jean-Camille Birget},
journal= {arXiv preprint arXiv:math/0310335},
year = {2007}
}
Comments
73 pages