Circuits, coNP-completeness, and the groups of Richard Thompson

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

73 pages

Scientific paper

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}.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Circuits, coNP-completeness, and the groups of Richard Thompson does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Circuits, coNP-completeness, and the groups of Richard Thompson, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circuits, coNP-completeness, and the groups of Richard Thompson will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-510180

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.