{"id":"https://openalex.org/W2034448590","doi":"https://doi.org/10.1137/0219002","title":"Complexity and Unsolvability Properties of Nilpotency","display_name":"Complexity and Unsolvability Properties of Nilpotency","publication_year":1990,"publication_date":"1990-02-01","ids":{"openalex":"https://openalex.org/W2034448590","doi":"https://doi.org/10.1137/0219002","mag":"2034448590"},"language":"en","primary_location":{"id":"doi:10.1137/0219002","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219002","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5079434052","display_name":"Irvin Roy Hentzel","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"I. R. Hentzel","raw_affiliation_strings":["Iowa State University Ames,"],"affiliations":[{"raw_affiliation_string":"Iowa State University Ames,","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010007087","display_name":"David P. Jacobs","orcid":"https://orcid.org/0000-0001-9409-0761"},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Pokrass Jacobs","raw_affiliation_strings":["Clemson University, Clemson, NC;"],"affiliations":[{"raw_affiliation_string":"Clemson University, Clemson, NC;","institution_ids":["https://openalex.org/I8078737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079434052"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.4975,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62240829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"1","first_page":"32","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9883999824523926,"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.9883999824523926,"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/T11703","display_name":"Rings, Modules, and Algebras","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9861999750137329,"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.8985857963562012},{"id":"https://openalex.org/keywords/nilpotent","display_name":"Nilpotent","score":0.5338080525398254},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5325105786323547},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4952780306339264},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.49130216240882874},{"id":"https://openalex.org/keywords/nilpotent-group","display_name":"Nilpotent group","score":0.4734634757041931},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4252767860889435},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41713446378707886},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3872458040714264},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38327741622924805},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3182215094566345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.09352871775627136}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8985857963562012},{"id":"https://openalex.org/C50555996","wikidata":"https://www.wikidata.org/wiki/Q840023","display_name":"Nilpotent","level":2,"score":0.5338080525398254},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5325105786323547},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4952780306339264},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.49130216240882874},{"id":"https://openalex.org/C206219070","wikidata":"https://www.wikidata.org/wiki/Q1755242","display_name":"Nilpotent group","level":3,"score":0.4734634757041931},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4252767860889435},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41713446378707886},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3872458040714264},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38327741622924805},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3182215094566345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.09352871775627136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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.1137/0219002","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0219002","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:lib.dr.iastate.edu:math_pubs-1145","is_oa":false,"landing_page_url":"https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1145&context=math_pubs","pdf_url":null,"source":{"id":"https://openalex.org/S4377196104","display_name":"Iowa State University Digital Repository (Iowa State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I173911158","host_organization_name":"Iowa State University","host_organization_lineage":["https://openalex.org/I173911158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematics Publications","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1554315206","https://openalex.org/W1978196835","https://openalex.org/W2080132708","https://openalex.org/W2085636480","https://openalex.org/W2230934865","https://openalex.org/W4232277851"],"related_works":["https://openalex.org/W2153554103","https://openalex.org/W2022486451","https://openalex.org/W3184171495","https://openalex.org/W2359607255","https://openalex.org/W3171737361","https://openalex.org/W2016920904","https://openalex.org/W2118240797","https://openalex.org/W4255512314","https://openalex.org/W2951885157","https://openalex.org/W2055652047"],"abstract_inverted_index":{"A":[0],"nonassociative":[1],"algebra":[2],"is":[3,7,24,50,60,95,101,121,142,155],"nilpotent":[4],"if":[5],"there":[6],"some":[8],"n":[9,16],"such":[10],"that":[11,62,141],"the":[12,41,82,145,149],"product":[13],"of":[14,43,91,138,152],"any":[15],"elements,":[17],"no":[18],"matter":[19],"how":[20],"they":[21],"are":[22,32],"associated,":[23],"zero.":[25],"Several":[26],"related,":[27],"but":[28,94],"more":[29],"general,":[30],"notions":[31],"left":[33,109,133],"nilpotency,":[34,37],"solvability,":[35],"local":[36,132],"and":[38,64,119,123,135],"nillity.":[39,110],"First":[40],"complexity":[42],"several":[44],"decision":[45],"problems":[46],"for":[47,84,107,144],"these":[48],"properties":[49],"examined.":[51],"In":[52],"finite-dimensional":[53],"algebras":[54,115],"over":[55],"a":[56,88,102,112,129,136],"finite":[57],"field":[58],"it":[59],"shown":[61,124],"solvability":[63,86],"nilpotency":[65,74,134],"can":[66,75],"be":[67,76,126],"decided":[68,77],"in":[69,78,148],"polynomial":[70,79,89,97,103],"time.":[71,98],"Over":[72],"Q,":[73],"time,":[80],"while":[81],"algorithm":[83,106],"testing":[85],"uses":[87],"number":[90],"arithmetic":[92,150],"operations,":[93],"not":[96],"Also":[99],"presented":[100],"time":[104],"probabilistic":[105],"deciding":[108],"Then":[111],"problem":[113],"involving":[114],"given":[116],"by":[117],"generators":[118],"relations":[120],"considered":[122],"to":[125],"NP-complete.":[127],"Finally,":[128],"relation":[130],"between":[131],"set":[137],"natural":[139],"numbers":[140],"1-complete":[143],"class":[146],"$\\Pi_{2}$":[147],"hierarchy":[151],"recursion":[153],"theory":[154],"demonstrated.":[156]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}