{"id":"https://openalex.org/W2092130624","doi":"https://doi.org/10.1137/s0097539794268315","title":"Computing Solutions Uniquely Collapses the Polynomial Hierarchy","display_name":"Computing Solutions Uniquely Collapses the Polynomial Hierarchy","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2092130624","doi":"https://doi.org/10.1137/s0097539794268315","mag":"2092130624"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794268315","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794268315","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/A5088546793","display_name":"Lane A. Hemaspaandra","orcid":"https://orcid.org/0000-0003-0659-5204"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lane A. Hemaspaandra","raw_affiliation_strings":["Dept. of CS, U. of Rochester, Rochester,"],"affiliations":[{"raw_affiliation_string":"Dept. of CS, U. of Rochester, Rochester,","institution_ids":["https://openalex.org/I5388228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109299269","display_name":"Ashish V. Naik","orcid":"https://orcid.org/0000-0003-0546-5977"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ashish V. Naik","raw_affiliation_strings":["Dept. of CS, SUNY-Buffalo, Buffalo,"],"affiliations":[{"raw_affiliation_string":"Dept. of CS, SUNY-Buffalo, Buffalo,","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019383096","display_name":"Mitsunori Ogihara","orcid":"https://orcid.org/0000-0002-5690-7854"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mitsunori Ogihara","raw_affiliation_strings":["Dept. of CS, U. of Rochester, Rochester,"],"affiliations":[{"raw_affiliation_string":"Dept. of CS, U. of Rochester, Rochester,","institution_ids":["https://openalex.org/I5388228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051370311","display_name":"Alan L. Selman","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan L. Selman","raw_affiliation_strings":["Dept. of CS, SUNY-Buffalo, Buffalo,"],"affiliations":[{"raw_affiliation_string":"Dept. of CS, SUNY-Buffalo, Buffalo,","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5088546793"],"corresponding_institution_ids":["https://openalex.org/I5388228"],"apc_list":null,"apc_paid":null,"fwci":4.37380628,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.9463807,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"25","issue":"4","first_page":"697","last_page":"708"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12072","display_name":"Machine Learning and Algorithms","score":0.9983999729156494,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8265625238418579},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.663843035697937},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6216537356376648},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.616788387298584},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.614707350730896},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5515637993812561},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.530358612537384},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5218276381492615},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5086897015571594},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4738907217979431},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45448848605155945},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4420930743217468},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4256998896598816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26724231243133545},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18319883942604065}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8265625238418579},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.663843035697937},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6216537356376648},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.616788387298584},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.614707350730896},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5515637993812561},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.530358612537384},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5218276381492615},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5086897015571594},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4738907217979431},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45448848605155945},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4420930743217468},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4256998896598816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26724231243133545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18319883942604065},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"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/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539794268315","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794268315","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":41,"referenced_works":["https://openalex.org/W1522419682","https://openalex.org/W1552419442","https://openalex.org/W1642094981","https://openalex.org/W1970089350","https://openalex.org/W1970465162","https://openalex.org/W1982717290","https://openalex.org/W1985433872","https://openalex.org/W1986602165","https://openalex.org/W1987257677","https://openalex.org/W1992972561","https://openalex.org/W1998918799","https://openalex.org/W2008999657","https://openalex.org/W2011042573","https://openalex.org/W2013374562","https://openalex.org/W2017240293","https://openalex.org/W2029671953","https://openalex.org/W2030155106","https://openalex.org/W2033908054","https://openalex.org/W2037662783","https://openalex.org/W2041317738","https://openalex.org/W2050774914","https://openalex.org/W2057512592","https://openalex.org/W2065251436","https://openalex.org/W2066390433","https://openalex.org/W2067811682","https://openalex.org/W2069139349","https://openalex.org/W2072181151","https://openalex.org/W2085634981","https://openalex.org/W2085861229","https://openalex.org/W2114877808","https://openalex.org/W2121602661","https://openalex.org/W2137407595","https://openalex.org/W2144526985","https://openalex.org/W2148761449","https://openalex.org/W2154327057","https://openalex.org/W2165676867","https://openalex.org/W2167194862","https://openalex.org/W2508395457","https://openalex.org/W2523974492","https://openalex.org/W3016161103","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1676587966","https://openalex.org/W2394532980","https://openalex.org/W236032","https://openalex.org/W2125536734","https://openalex.org/W2000805093","https://openalex.org/W2415632638","https://openalex.org/W1638461282","https://openalex.org/W2021218132","https://openalex.org/W2031104867","https://openalex.org/W2020831804"],"abstract_inverted_index":{"Is":[0],"there":[1,41,120],"an":[2,81],"NP":[3,78,82,95,125,133,183],"function":[4,23,68,79,126],"that,":[5],"when":[6],"given":[7],"a":[8,21,30,44,67,105,113,122,152,240],"satisfiable":[9],"formula":[10],"as":[11],"input,":[12],"outputs":[13],"one":[14,26],"satisfying":[15,27],"assignment":[16,28],"uniquely?":[17],"That":[18],"is,":[19],"can":[20],"nondeterministic":[22,45,153],"cull":[24],"just":[25],"from":[29,239],"possibly":[31],"exponentially":[32],"large":[33],"collection":[34],"of":[35,65,107,138,155,159,168],"assignments?":[36],"We":[37,100,110,219],"show":[38],"that":[39,94,112,135,179,207,221],"if":[40,119,208,231],"is":[42,69,116,121,143,151,184,194,212,216,250],"such":[43,66],"function,":[46],"then":[47,196,214],"the":[48,63,75,90,156,160,164,176,187,222],"polynomial":[49,223],"hierarchy":[50,224],"collapses":[51,225],"to":[52,59,71,74,146,148,229],"${\\text{ZPP}}^{{\\text{NP}}}":[53],"$":[54],"(and":[55],"thus,":[56],"in":[57,182,251],"particular,":[58],"${\\text{NP}}^{{\\text{NP}}}":[60],"$).":[61],"Because":[62],"existence":[64],"known":[70],"be":[72,98],"equivalent":[73],"statement":[76],"\"every":[77],"has":[80],"refinement":[83],"with":[84,127,186],"unique":[85,128],"outputs,\"":[86],"our":[87,102],"result":[88,103,106,172,243],"provides":[89],"strongest":[91],"evidence":[92],"yet":[93],"functions":[96],"cannot":[97],"refined.":[99],"prove":[101,206,220],"via":[104],"independent":[108],"interest.":[109],"say":[111],"set":[114,181,249],"A":[115,215],"NPSV-selective":[117],"(NPMV-selective)":[118],"2-ary":[123,131],"partial":[124,132],"values":[129],"(a":[130],"function)":[134],"decides":[136],"which":[137],"its":[139],"inputs":[140],"(if":[141],"any)":[142],"\"more":[144],"likely\"":[145],"belong":[147],"A;":[149],"this":[150],"analog":[154],"recursion-theoretic":[157],"notion":[158,167],"semirecursive":[161],"sets":[162,234],"and":[163],"extant":[165],"complexity-theoretic":[166],"P-selectivity.":[169],"Our":[170],"hierarchy-collapse":[171],"follows":[173,238],"by":[174],"combining":[175],"easy":[177],"observation":[178],"every":[180],"NPMV-selective":[185,248],"following":[188],"result:":[189],"If":[190],"$A":[191,197,209],"\\in":[192,198,210],"{\\text{NP}}$":[193,211],"NPSV-selective,":[195,213],"{{({\\text{NP}}":[199],"\\cap":[200],"{\\text{coNP}})}":[201],"/":[202],"{{\\text{poly}}}}$.":[203],"Relatedly,":[204],"we":[205,244],"${\\text{Low}}_2":[217],"$.":[218],"even":[226],"further,":[227],"namely":[228],"NP,":[230],"all":[232],"coNP":[233],"are":[235],"NPMV-selective.":[236],"This":[237],"more":[241],"general":[242],"prove:":[245],"Every":[246],"self-reducible":[247],"NP.":[252]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}