{"id":"https://openalex.org/W7129075773","doi":"https://doi.org/10.48550/arxiv.2602.12350","title":"Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP","display_name":"Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP","publication_year":2026,"publication_date":"2026-02-12","ids":{"openalex":"https://openalex.org/W7129075773","doi":"https://doi.org/10.48550/arxiv.2602.12350"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.12350","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126099937","display_name":"Christoph Gr\u00fcne","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gr\u00fcne, Christoph","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008746527","display_name":"Berit Johannes","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Johannes, Berit","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Orlin, James B.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5062230321","display_name":"Lasse Wulf","orcid":"https://orcid.org/0000-0001-7139-4092"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wulf, Lasse","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":0,"citation_normalized_percentile":{"value":0.13119595,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.2549999952316284,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.2549999952316284,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2199999988079071,"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/T11031","display_name":"Game Theory and Applications","score":0.05719999969005585,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.7849000096321106},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7563999891281128},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6682000160217285},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6632999777793884},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5103999972343445},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4918000102043152},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47099998593330383},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.42879998683929443},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42500001192092896}],"concepts":[{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.7849000096321106},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7563999891281128},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6682000160217285},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6632999777793884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6581000089645386},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5103999972343445},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4918000102043152},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.42879998683929443},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42500001192092896},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4097999930381775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40529999136924744},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3741999864578247},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3531999886035919},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.3043000102043152},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2831000089645386},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.26919999718666077},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.12350","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.12350","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.12350","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.12350","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Many":[0],"natural":[1,65,183],"optimization":[2,223],"problems":[3,35,90,208,224],"derived":[4,91,225],"from":[5,92,226],"$\\sf":[6,46,54,87,93,103,108,139,150,162,178,210,227,248],"NP$":[7,109,228],"admit":[8],"bilevel":[9],"and":[10,30,86,142,158,193,229],"multilevel":[11,222,245],"extensions":[12,185,190,196,246],"in":[13,26,49,82,115],"which":[14,105,116],"decisions":[15],"are":[16,36,68,118,161,186,191,197,209],"made":[17],"sequentially":[18],"by":[19,39],"multiple":[20],"players":[21],"with":[22,110,123],"conflicting":[23],"objectives,":[24],"as":[25],"interdiction,":[27],"adversarial":[28],"selection,":[29],"adjustable":[31],"robust":[32],"optimization.":[33],"Such":[34],"naturally":[37],"modeled":[38],"alternating":[40],"quantifiers":[41],"and,":[42],"therefore,":[43],"lie":[44],"beyond":[45],"NP$,":[47,104],"typically":[48],"the":[50,83,200,206],"polynomial":[51,84],"hierarchy":[52,85],"or":[53],"PSPACE$.":[55],"Despite":[56],"extensive":[57],"study":[58],"of":[59,102,127,148,202,244,247],"these":[60,71],"problem":[61,176],"classes,":[62],"relatively":[63],"few":[64],"completeness":[66,81,219],"results":[67,213,220],"known":[69,218],"at":[70],"higher":[72],"levels.":[73],"We":[74,137],"introduce":[75],"a":[76,100,124,145,175,241],"general":[77,170],"framework":[78],"for":[79,89,221],"proving":[80],"PSPACE$":[88],"NP$.":[94],"Our":[95,212],"approach":[96],"is":[97,177,204,240],"based":[98],"on":[99],"refinement":[101],"we":[106,168],"call":[107],"solutions":[111,117],"($\\sf":[112],"NP$-$\\sf":[113,140,163,179],"S$),":[114],"explicit":[119],"combinatorial":[120],"objects,":[121],"together":[122],"restricted":[125],"class":[126],"reductions":[128,131],"--":[129,132],"solution-embedding":[130],"that":[133,144,173,236],"preserve":[134],"solution":[135],"structure.":[136],"define":[138],"S$-completeness":[141],"show":[143],"large":[146],"collection":[147],"classical":[149],"NP$-complete":[151,249],"problems,":[152],"including":[153],"Clique,":[154],"Vertex":[155],"Cover,":[156],"Knapsack,":[157],"Traveling":[159],"Salesman,":[160],"S$-complete.":[164],"Using":[165],"this":[166],"framework,":[167],"establish":[169],"meta-theorems":[171],"showing":[172],"if":[174],"S$-complete,":[180],"then":[181],"its":[182,188,194],"two-level":[184],"$\u03a3_2^p$-complete,":[187],"three-level":[189],"$\u03a3_3^p$-complete,":[192],"$k$-level":[195],"$\u03a3_k^p$-complete.":[198],"When":[199],"number":[201],"levels":[203],"unbounded,":[205],"resulting":[207],"PSPACE$-complete.":[211],"subsume":[214],"nearly":[215],"all":[216],"previously":[217],"yield":[230],"many":[231],"new":[232],"ones":[233],"simultaneously,":[234],"demonstrating":[235],"high":[237],"computational":[238],"complexity":[239],"generic":[242],"feature":[243],"problems.":[250]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-17T00:00:00"}