{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:10:13Z","timestamp":1758280213951},"reference-count":33,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[2006,2]]},"abstract":"<jats:p>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\u2013Higman group G<jats:sub>3,1<\/jats:sub>.<\/jats:p>","DOI":"10.1142\/s0218196706002822","type":"journal-article","created":{"date-parts":[[2006,3,8]],"date-time":"2006-03-08T10:49:22Z","timestamp":1141814962000},"page":"35-90","source":"Crossref","is-referenced-by-count":12,"title":["CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS"],"prefix":"10.1142","volume":"16","author":[{"given":"JEAN-CAMILLE","family":"BIRGET","sequence":"first","affiliation":[{"name":"Department of Computer Science, Rutgers University at Camden, Camden, NJ 08102, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1137\/0218053"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196798000132"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00131-5"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196704001815"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196704001980"},{"key":"rf8","doi-asserted-by":"crossref","first-page":"467","DOI":"10.2307\/3597196","volume":"156","author":"Birget J. C.","journal-title":"Ann. of Math."},{"key":"rf9","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198507727.001.0001","volume-title":"Invitations to Geometry and Topology","author":"Bridson M.","year":"2002"},{"key":"rf10","first-page":"1053","volume":"10","author":"Brady N.","journal-title":"GAFA"},{"key":"rf11","first-page":"215","volume":"42","author":"Cannon J. W.","journal-title":"L'Enseignement Math\u00e9matique"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01857727"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90074-C"},{"key":"rf14","series-title":"London Mathematical Society Lecture Notes Series","volume-title":"Geometric Group Theory","volume":"182","author":"Gromov M.","year":"1993"},{"key":"rf15","series-title":"Notes on Pure Mathematics 8","volume-title":"Finitely presented infinite simple groups","author":"Higman G.","year":"1974"},{"key":"rf16","first-page":"2597","volume":"257","author":"Lecerf Y.","journal-title":"Comptes Rendus de l'Acad\u00e9mie des Sciences, Paris"},{"key":"rf17","volume-title":"Handbook of Theoretical Computer Science","author":"van Leeuwen J.","year":"1990"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1145\/322017.322031"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61896-3"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(85)80022-5"},{"key":"rf21","volume-title":"Combinatorial Group Theory, Dover, 1976","author":"Magnus W.","year":"1966"},{"key":"rf22","unstructured":"R.\u00a0McKenzie and R. J.\u00a0Thompson, Word Problems, eds. W. W.\u00a0Boone, F. B.\u00a0Cannonito and R. C.\u00a0Lyndon (North-Holland, 1973)\u00a0pp. 457\u2013478."},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.4213\/sm276"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196791000183"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196701000401"},{"key":"rf26","volume-title":"Einf\u00fchrung in die kombinatorische Topologie, Chelsea, New York, 1950","author":"Reidemeister K.","year":"1932"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1006\/jabr.1999.7898"},{"key":"rf28","doi-asserted-by":"crossref","first-page":"345","DOI":"10.2307\/3597195","volume":"156","author":"Sapir M. V.","journal-title":"Ann. Math."},{"key":"rf29","volume-title":"Models of Computation","author":"Savage J. E.","year":"1998"},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(84)90172-8"},{"key":"rf31","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(84)90174-1"},{"key":"rf32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9730-4_4"},{"key":"rf34","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71348-X"},{"key":"rf35","volume-title":"The Complexity of Boolean Functions","author":"Wegener I.","year":"1987"}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196706002822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T06:57:51Z","timestamp":1706943471000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218196706002822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":33,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1142\/S0218196706002822"],"URL":"https:\/\/doi.org\/10.1142\/s0218196706002822","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"value":"0218-1967","type":"print"},{"value":"1793-6500","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}