{"id":"https://openalex.org/W2911798073","doi":"https://doi.org/10.1137/07068196x","title":"Hierarchical Unambiguity","display_name":"Hierarchical Unambiguity","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2911798073","doi":"https://doi.org/10.1137/07068196x","mag":"2911798073"},"language":"en","primary_location":{"id":"doi:10.1137/07068196x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07068196x","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/A5079433563","display_name":"Holger Spakowski","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Holger Spakowski","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051292203","display_name":"Rahul Tripathi","orcid":"https://orcid.org/0000-0001-5587-0888"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rahul Tripathi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.36608132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"38","issue":"5","first_page":"2079","last_page":"2112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9972000122070312,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9972000122070312,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11567","display_name":"semigroups and automata theory","score":0.9847999811172485,"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/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.7428054213523865},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.6810947060585022},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6630374789237976},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6605693697929382},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6558973789215088},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.6129424571990967},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5324289202690125},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.5297060012817383},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5296580195426941},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.529485285282135},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5277674198150635},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5061919093132019},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5045188665390015},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49580249190330505},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.47899553179740906},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44624418020248413},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42765581607818604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4233849346637726},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.3806474208831787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22309231758117676},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.19408541917800903}],"concepts":[{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.7428054213523865},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.6810947060585022},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6630374789237976},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6605693697929382},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6558973789215088},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.6129424571990967},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5324289202690125},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.5297060012817383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5296580195426941},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.529485285282135},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5277674198150635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5061919093132019},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5045188665390015},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49580249190330505},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.47899553179740906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44624418020248413},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42765581607818604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4233849346637726},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3806474208831787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22309231758117676},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.19408541917800903},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/07068196x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07068196x","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1972556723","https://openalex.org/W1979916222","https://openalex.org/W1981741030","https://openalex.org/W1982143949","https://openalex.org/W1988529552","https://openalex.org/W1993138363","https://openalex.org/W2000291823","https://openalex.org/W2008585307","https://openalex.org/W2010699490","https://openalex.org/W2021765168","https://openalex.org/W2023467318","https://openalex.org/W2024048801","https://openalex.org/W2046843996","https://openalex.org/W2058277150","https://openalex.org/W2060270693","https://openalex.org/W2062767125","https://openalex.org/W2063158069","https://openalex.org/W2068944040","https://openalex.org/W2070323038","https://openalex.org/W2072727451","https://openalex.org/W2076163391","https://openalex.org/W2080370600","https://openalex.org/W2083553352","https://openalex.org/W2083770479","https://openalex.org/W2085634981","https://openalex.org/W2089914953","https://openalex.org/W2111824166","https://openalex.org/W2175992284","https://openalex.org/W2913619063","https://openalex.org/W4241163394","https://openalex.org/W4300757861"],"related_works":["https://openalex.org/W2088158977","https://openalex.org/W2086059606","https://openalex.org/W1999609654","https://openalex.org/W1520700928","https://openalex.org/W1504200807","https://openalex.org/W2053392269","https://openalex.org/W1556737090","https://openalex.org/W2122747219","https://openalex.org/W2911798073","https://openalex.org/W2415632638"],"abstract_inverted_index":{"We":[0,9],"develop":[1],"techniques":[2,12,41],"to":[3,13,26,123,127,134],"investigate":[4],"relativized":[5,18,35],"hierarchical":[6,48],"unambiguous":[7,36,51],"computation.":[8],"apply":[10],"our":[11],"generalize":[14],"known":[15],"constructs":[16,28],"involving":[17,29],"unambiguity":[19],"based":[20],"complexity":[21],"classes":[22],"(UP":[23],"and":[24,56,63,106,129],"Promise-UP)":[25],"new":[27],"arbitrary":[30],"higher":[31],"levels":[32],"of":[33,50,78],"the":[34,71],"polynomial":[37],"hierarchy":[38],"(UPH).":[39],"Our":[40],"are":[42],"developed":[43],"on":[44,119],"constraints":[45],"imposed":[46],"by":[47,103],"arrangement":[49],"nondeterministic":[52],"polynomial-time":[53],"Turing":[54,125,132],"machines,":[55],"so":[57],"they":[58],"differ":[59],"substantially,":[60],"in":[61,64,88,108],"applicability":[62],"nature,":[65],"from":[66,94],"standard":[67],"methods":[68],"(such":[69],"as":[70],"switching":[72],"lemma":[73],"[J.":[74],"H\u00e5stad,":[75],"Computational":[76],"Limitations":[77],"Small-Depth":[79],"Circuits,":[80],"MIT":[81],"Press,":[82,113],"Cambridge,":[83,114],"1987]),":[84],"which":[85],"play":[86],"roles":[87],"carrying":[89],"out":[90],"similar":[91],"generalizations.":[92],"Aside":[93],"achieving":[95],"these":[96],"generalizations,":[97],"we":[98],"resolve":[99],"a":[100],"question":[101],"posed":[102],"Cai,":[104],"Hemachandra,":[105],"Vysko\u010d":[107],"[Complexity":[109],"Theory,":[110],"Cambridge":[111],"University":[112],"UK,":[115],"1993,":[116],"pp.":[117],"101\u2013146],":[118],"an":[120],"issue":[121],"related":[122],"nonadaptive":[124],"access":[126,133],"UP":[128],"adaptive":[130],"smart":[131],"Promise-UP.":[135]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}