{"id":"https://openalex.org/W1986593186","doi":"https://doi.org/10.1142/s0218196798000132","title":"Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem","display_name":"Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem","publication_year":1998,"publication_date":"1998-04-01","ids":{"openalex":"https://openalex.org/W1986593186","doi":"https://doi.org/10.1142/s0218196798000132","mag":"1986593186"},"language":"en","primary_location":{"id":"doi:10.1142/s0218196798000132","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218196798000132","pdf_url":null,"source":{"id":"https://openalex.org/S23260266","display_name":"International Journal of Algebra and Computation","issn_l":"0218-1967","issn":["0218-1967","1793-6500"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Algebra and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109973858","display_name":"Jean-Camille Birget","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jean-Camille Birget","raw_affiliation_strings":["Department of Computer Science, University of Nebraska, Lincoln, NE 68588-0115, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska, Lincoln, NE 68588-0115, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109973858"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":1.9633,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.84940312,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"08","issue":"02","first_page":"235","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8406878113746643},{"id":"https://openalex.org/keywords/semigroup","display_name":"Semigroup","score":0.7381479740142822},{"id":"https://openalex.org/keywords/word-problem","display_name":"Word problem (mathematics education)","score":0.7323182225227356},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6177389621734619},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5611570477485657},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.494825541973114},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47888749837875366},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.4426466226577759},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.41885384917259216},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.3001386523246765},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.23651984333992004},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13312527537345886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08400088548660278}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8406878113746643},{"id":"https://openalex.org/C207405024","wikidata":"https://www.wikidata.org/wiki/Q207348","display_name":"Semigroup","level":2,"score":0.7381479740142822},{"id":"https://openalex.org/C90988201","wikidata":"https://www.wikidata.org/wiki/Q255912","display_name":"Word problem (mathematics education)","level":2,"score":0.7323182225227356},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6177389621734619},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5611570477485657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.494825541973114},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47888749837875366},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.4426466226577759},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.41885384917259216},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.3001386523246765},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.23651984333992004},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13312527537345886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08400088548660278},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0218196798000132","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218196798000132","pdf_url":null,"source":{"id":"https://openalex.org/S23260266","display_name":"International Journal of Algebra and Computation","issn_l":"0218-1967","issn":["0218-1967","1793-6500"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Algebra and Computation","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11665002120004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/Time-Complexity-of-the-Word-Problem-for/991031665754204646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W3492891","https://openalex.org/W1537233909","https://openalex.org/W1577560285","https://openalex.org/W1967684312","https://openalex.org/W1986203294","https://openalex.org/W1987331423","https://openalex.org/W2003323474","https://openalex.org/W2022763264","https://openalex.org/W2029872977","https://openalex.org/W2034460536","https://openalex.org/W2039302045","https://openalex.org/W2053365840","https://openalex.org/W2075639491","https://openalex.org/W2076095858","https://openalex.org/W2077614353","https://openalex.org/W2091066884","https://openalex.org/W2092759805","https://openalex.org/W2105259569","https://openalex.org/W2135126413","https://openalex.org/W2158086683","https://openalex.org/W2614477779"],"related_works":["https://openalex.org/W4226247106","https://openalex.org/W2017609259","https://openalex.org/W1486286946","https://openalex.org/W1981385397","https://openalex.org/W1980879781","https://openalex.org/W2035025857","https://openalex.org/W2122747219","https://openalex.org/W2080505327","https://openalex.org/W2101153990","https://openalex.org/W4206232732"],"abstract_inverted_index":{"The":[0,209],"following":[1],"algebraic":[2,302,314],"characterization":[3],"of":[4,8,21,24,104,110,116,202,212,274,304,316],"the":[5,9,19,25,50,72,85,101,107,113,121,128,172,199,271,309],"computational":[6],"complexity":[7,42,125,207],"word":[10,37,102,108,114,141,161,200,210,272],"problem":[11,38,103,109,142,162,201,211,249,273],"for":[12],"finitely":[13,33,66,135,156,177,185,214,235,276,295],"generated":[14,34,136,178,215],"semigroups":[15,297],"is":[16,46,54,88,95,152,163,181,218,251,263,300,312],"proved,":[17],"in":[18,64,70,143,146,164,167,183,219,224,233,252,257],"form":[20],"a":[22,32,47,65,96,134,140,155,176,184,213,234,266,275],"refinement":[23],"Higman":[26],"Embedding":[27],"Theorem:":[28],"Let":[29],"S":[30,60,117,138,151,180,203,217,229],"be":[31,62,231],"semigroup":[35,68,137,158,179,187,216,237,278],"whose":[36,160],"has":[39,139,204],"nondeterministic":[40,123,205,305,317],"time":[41,124,131,206,318],"T":[43,45],"(where":[44,194],"function":[48,191,311],"on":[49],"positive":[51],"integers":[52],"which":[53,71],"superadditive,":[55],"i.e.":[56],"T(n+m)":[57],"\u2265T(n)+T(m)).":[58],"Then":[59],"can":[61,230],"embedded":[63,232],"presented":[67,157,186,236,277,296],"H":[69,105,119,159,188,238],"derivation":[73],"distance":[74],"between":[75],"any":[76],"two":[77],"equivalent":[78],"words":[79],"x":[80],"and":[81,118],"y":[82],"(and":[83,126],"hence":[84],"isoperimetric":[86,190,245,285,310],"function)":[87],"O":[89],"(T(\u2223x\u2223+\u2223y\u2223)":[90],"2":[91],").":[92],"Moreover,":[93],"there":[94],"conjunctive":[97],"linear-time":[98,267],"reduction":[99],"from":[100],"to":[106,270],"S,":[111],"so":[112],"problems":[115],"have":[120],"same":[122,129],"also":[127],"deterministic":[130],"complexity).":[132],"Thus,":[133],"NTIME(T)":[144,165],"(or":[145,221,254],"DTIME(T":[147,168],"o":[148,169],"))":[149,227,260],"iff":[150,228,261],"embeddable":[153,182],"into":[154,294],"(respectively":[166,241,281],")).":[170],"In":[171,287],"other":[173],"direction,":[174],"if":[175],"with":[189,239,279],"\u2264":[192],"D":[193],"D(n)":[195],"\u2265":[196],"n),":[197],"then":[198],"O(D).":[208],"NP":[220,253],"more":[222,255],"generally,":[223,256],"NTIME((T)":[225,258],"O(1)":[226,243,259,283],"polynomial":[240,280],"(T)":[242,282],")":[244,284],"function.":[246,286],"An":[247],"algorithmic":[248],"L":[250,262],"reducible":[264],"(via":[265],"one-to-one":[268],"reduction)":[269],"essence,":[288],"this":[289],"shows:":[290],"(1)":[291],"Finding":[292],"embeddings":[293],"or":[298],"groups":[299],"an":[301,313],"analogue":[303,315],"algorithm":[306],"design;":[307],"(2)":[308],"complexity.":[319]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}