{"id":"https://openalex.org/W7170156303","doi":"https://doi.org/10.4230/lipics.ccc.2026.37","title":"Separations Above TFNP from Sherali-Adams Lower Bounds","display_name":"Separations Above TFNP from Sherali-Adams Lower Bounds","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170156303","doi":"https://doi.org/10.4230/lipics.ccc.2026.37"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.37","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.37","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.37","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082438935","display_name":"Noah Fleming","orcid":"https://orcid.org/0000-0002-8636-1290"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]},{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["SE","US"],"is_corresponding":false,"raw_author_name":"Fleming, Noah","raw_affiliation_strings":["Lund University, Sweden","Columbia University, New York, NY, USA"],"raw_orcid":"https://orcid.org/0000-0002-8636-1290","affiliations":[{"raw_affiliation_string":"Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078455094","display_name":"Anna G\u00e1l","orcid":"https://orcid.org/0000-0001-9772-3966"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G\u00e1l, Anna","raw_affiliation_strings":["University of Texas at Austin, TX, USA"],"raw_orcid":"https://orcid.org/0000-0001-9772-3966","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126460902","display_name":"Deniz Imrek","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Imrek, Deniz","raw_affiliation_strings":["University of Texas at Austin, TX, USA"],"raw_orcid":"https://orcid.org/0009-0009-0459-070X","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5126506539","display_name":"Christophe Marciot","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Marciot, Christophe","raw_affiliation_strings":["Lund University, Sweden"],"raw_orcid":"https://orcid.org/0009-0003-0831-5509","affiliations":[{"raw_affiliation_string":"Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6466000080108643},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.512499988079071},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5019000172615051},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47699999809265137},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4440000057220459},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4399999976158142},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.43869999051094055}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7387999892234802},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6466000080108643},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5163999795913696},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.512499988079071},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5019000172615051},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4778999984264374},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47699999809265137},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4399999976158142},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.43869999051094055},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.38589999079704285},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.34689998626708984},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2628999948501587}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.37","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.37","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.37","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.37","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"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":{"Unlike":[0],"in":[1,40,73,106,148,187],"TFNP,":[2],"for":[3],"which":[4,15],"there":[5,138],"is":[6,139,186],"an":[7],"abundance":[8],"of":[9,33,44,85,88,96,143,151,173,191],"problems":[10,36,89,105],"capturing":[11],"natural":[12,35],"existence":[13,172,190],"principles":[14],"are":[16],"incomparable":[17],"(in":[18],"the":[19,34,41,45,53,63,74,78,86,107,144,152,161,166,171,189,212,218],"black-box":[20,75],"setting),":[21],"Kleinberg":[22,26],"et":[23,27,121],"al.":[24],"[Robert":[25],"al.,":[28,122],"2021]":[29],"observed":[30],"that":[31,62,82,128,137,170,211,217],"many":[32],"considered":[37],"so":[38,199],"far":[39],"second":[42],"level":[43],"total":[46,103],"function":[47],"polynomial":[48,108],"hierarchy":[49,109],"(TF\u03a3\u2082)":[50],"reduce":[51,69],"to":[52,70,91,129,135,165,197,225],"Strong":[54,71,92],"Avoid":[55,72],"problem.":[56],"In":[57,124],"this":[58,126],"work,":[59],"we":[60,159,195],"prove":[61],"Linear":[64,145,219],"Ordering":[65,146,220],"Principle":[66,147,221],"does":[67],"not":[68],"setting,":[76,168],"exhibiting":[77],"first":[79],"TF\u03a3\u2082":[80],"problem":[81,205,227],"lies":[83],"outside":[84],"class":[87],"reducible":[90],"Avoid.":[93],"The":[94,182],"proof":[95,111,142,154],"our":[97,131],"separation":[98],"exploits":[99],"a":[100,149,174,178,193,202,229],"connection":[101],"between":[102],"search":[104],"and":[110,118],"complexity,":[112],"recently":[113],"developed":[114],"by":[115,200],"Fleming,":[116],"Imrek,":[117],"Marciot":[119],"[Fleming":[120],"2025].":[123],"particular,":[125],"implies":[127,216],"show":[130,136,210],"separation,":[132],"it":[133],"suffices":[134],"no":[140],"small":[141],"\u03a3\u2082-variant":[150],"Sherali-Adams":[153,180,231],"system.":[155],"To":[156],"do":[157,198],"so,":[158],"extend":[160],"classical":[162],"pseudo-expectation":[163,176,214],"method":[164],"\u03a3\u2082":[167,175,179],"showing":[169],"precludes":[177],"proof.":[181],"main":[183],"technical":[184],"challenge":[185],"proving":[188],"such":[192],"pseudo-expectation,":[194],"manage":[196],"solving":[201],"combinatorial":[203],"covering":[204],"about":[206],"permutations.":[207],"We":[208],"also":[209],"extended":[213],"bound":[215],"cannot":[222],"be":[223],"reduced":[224],"any":[226],"admitting":[228],"low-degree":[230],"refutation.":[232]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}