CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
2006 ◽
Vol 16
(01)
◽
pp. 35-90
◽
Keyword(s):
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 G3,1.
1974 ◽
Vol 18
(1)
◽
pp. 41-53
◽
2016 ◽
Vol 28
(3)
◽
pp. 457-471
◽
2018 ◽
Vol 28
(07)
◽
pp. 1299-1381
1974 ◽
Vol 18
(1)
◽
pp. 1-7
◽
1965 ◽
Vol 53
(2)
◽
pp. 265-269
◽
2020 ◽
Vol 30
(04)
◽
pp. 693-710
1998 ◽
Vol 08
(01)
◽
pp. 23-34
◽
1992 ◽
Vol 45
(3)
◽
pp. 513-520
◽