{"id":"https://openalex.org/W7131426172","doi":"https://doi.org/10.4230/lipics.stacs.2026.52","title":"Upper and Lower Bounds for the Linear Ordering Principle","display_name":"Upper and Lower Bounds for the Linear Ordering Principle","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7131426172","doi":"https://doi.org/10.4230/lipics.stacs.2026.52"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25541","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.52","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.52/LIPIcs.STACS.2026.52.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.52/LIPIcs.STACS.2026.52.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035077817","display_name":"Edward Hirsch","orcid":null},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Hirsch, Edward A.","raw_affiliation_strings":["Department of Computer Science, Ariel University, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ariel University, Israel","institution_ids":["https://openalex.org/I52170813"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073965203","display_name":"Ilya Volkovich","orcid":"https://orcid.org/0000-0002-7616-0751"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Volkovich, Ilya","raw_affiliation_strings":["Boston College, Chestnut Hill, MA, USA"],"affiliations":[{"raw_affiliation_string":"Boston College, Chestnut Hill, MA, USA","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035077817"],"corresponding_institution_ids":["https://openalex.org/I52170813"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65090987,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.699999988079071,"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.699999988079071,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.06989999860525131,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.04639999940991402,"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/containment","display_name":"Containment (computer programming)","score":0.5787000060081482},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5264999866485596},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5022000074386597},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5019999742507935},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.49559998512268066},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4514999985694885}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7443000078201294},{"id":"https://openalex.org/C2777019822","wikidata":"https://www.wikidata.org/wiki/Q390066","display_name":"Containment (computer programming)","level":2,"score":0.5787000060081482},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5264999866485596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5220000147819519},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5022000074386597},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5019999742507935},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.49559998512268066},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4189999997615814},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4169999957084656},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4075999855995178},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4050999879837036},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4020000100135803},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.28780001401901245}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25541","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.52","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.52/LIPIcs.STACS.2026.52.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.stacs.2026.52","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2026.52","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25541","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.52","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.52/LIPIcs.STACS.2026.52.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7131426172.pdf","grobid_xml":"https://content.openalex.org/works/W7131426172.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Korten":[0,204],"and":[1,33,53,71,79,88,114,160,185,189,205,237,242,249],"Pitassi":[2,206],"(FOCS,":[3],"2024)":[4],"defined":[5],"a":[6,102,112,119,208],"new":[7],"complexity":[8],"class":[9,85],"L\u2082^P":[10,68],"as":[11],"the":[12,17,26,38,41,60,82,107,116,135,171,175,220,256],"polynomial-time":[13],"Turing":[14],"closure":[15],"of":[16,28,59,111,118,125,138,174,181,203,268],"Linear":[18],"Ordering":[19],"Principle":[20],"(a":[21],"total":[22],"function":[23],"extending":[24],"finding":[25],"minimum":[27,117],"an":[29,97,150,154,196,200],"order":[30,42,109],"[M.":[31],"Chiari":[32],"J.":[34],"Kraj\u00ed\u010dek,":[35],"1998]":[36],"to":[37,105,153,199,223,232,235,243,247],"case":[39],"where":[40],"is":[43,81,94,128,134,225],"not":[44],"linear).":[45],"They":[46],"put":[47],"it":[48],"between":[49,69,86,258],"MA":[50,87],"(Merlin-Arthur":[51],"protocols)":[52],"S\u2082^P":[54],"(the":[55],"second":[56],"symmetric":[57],"level":[58],"polynomial":[61],"hierarchy).":[62],"In":[63],"this":[64,126],"paper":[65,127],"we":[66,254],"sandwich":[67],"P^prMA":[70,166,233],"P^prSBP.":[72],"(The":[73],"oracles":[74],"here":[75],"are":[76],"promise":[77],"problems,":[78],"SBP":[80],"only":[83],"known":[84,230],"AM.)":[89],"The":[90],"containment":[91,123,141],"in":[92],"P^prSBP":[93],"proved":[95],"via":[96],"iterative":[98],"process":[99],"that":[100,219],"uses":[101],"prSBP":[103],"oracle":[104],"estimate":[106],"average":[108],"rank":[110],"subset":[113],"find":[115],"linear":[120],"order.":[121],"Another":[122],"result":[124],"P^prO\u2082^P":[129],"\u2286":[130,167],"O\u2082^P":[131,133,244],"(where":[132],"input-oblivious":[136],"version":[137],"S\u2082^P).":[139],"These":[140],"results":[142,180],"altogether":[143],"have":[144],"several":[145],"byproducts:":[146],"-":[147,193,216],"We":[148,194,217],"give":[149,195],"affirmative":[151,197],"answer":[152,198],"open":[155,201],"question":[156,202],"posed":[157],"by":[158],"Chakaravarthy":[159,184,236,248],"Roy":[161,238,250],"(Computational":[162,239],"Complexity,":[163,240],"2011)":[164,241],"whether":[165,207],"S\u2082^P,":[168],"thereby":[169],"settling":[170],"relative":[172],"standing":[173],"existing":[176],"(non-oblivious)":[177],"Karp\u2013Lipton\u2013style":[178],"collapse":[179,210,222],"[V.":[182],"T.":[183],"S.":[186],"Roy,":[187],"2011]":[188],"[J.-Y.":[190],"Cai,":[191],"2007],":[192],"Karp-Lipton-style":[209,221],"can":[211],"be":[212],"proven":[213],"for":[214],"L\u2082^P,":[215],"show":[218],"P^prOMA":[224],"actually":[226],"better":[227],"than":[228],"both":[229],"collapses":[231,262],"due":[234,246],"also":[245],"(STACS,":[251],"2006).":[252],"Thus":[253],"resolve":[255],"controversy":[257],"previously":[259],"incomparable":[260],"Karp-Lipton":[261],"stemming":[263],"from":[264],"these":[265],"two":[266],"lines":[267],"research.":[269]},"counts_by_year":[],"updated_date":"2026-03-23T07:41:27.035349","created_date":"2026-02-26T00:00:00"}