{"id":"https://openalex.org/W7125509442","doi":"https://doi.org/10.4230/lipics.itcs.2026.8","title":"Intersection Theorems: A Potential Approach to Proof Complexity Lower Bounds","display_name":"Intersection Theorems: A Potential Approach to Proof Complexity Lower Bounds","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7125509442","doi":"https://doi.org/10.4230/lipics.itcs.2026.8"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25295","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol362-itcs2026/LIPIcs.ITCS.2026.8/LIPIcs.ITCS.2026.8.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-vol362-itcs2026/LIPIcs.ITCS.2026.8/LIPIcs.ITCS.2026.8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123674549","display_name":"Yaroslav Alekseev","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Alekseev, Yaroslav","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0003-3196-6919","affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035876524","display_name":"Nikita Gaevoy","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gaevoy, Nikita","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13160076,"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.7203999757766724,"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.7203999757766724,"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.1615000069141388,"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/T10237","display_name":"Cryptography and Data Security","score":0.024399999529123306,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.9043999910354614},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.7578999996185303},{"id":"https://openalex.org/keywords/direct-proof","display_name":"Direct proof","score":0.7282999753952026},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.6822999715805054},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5246999859809875},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.4648999869823456},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4544999897480011}],"concepts":[{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.9043999910354614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7605000138282776},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7578999996185303},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.7282999753952026},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.6822999715805054},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5246999859809875},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5146999955177307},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4975999891757965},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.4648999869823456},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4544999897480011},{"id":"https://openalex.org/C118539577","wikidata":"https://www.wikidata.org/wiki/Q3402784","display_name":"Combinatorial proof","level":2,"score":0.387800008058548},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.30250000953674316},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.25780001282691956}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25295","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol362-itcs2026/LIPIcs.ITCS.2026.8/LIPIcs.ITCS.2026.8.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.itcs.2026.8","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2026.8","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:25295","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol362-itcs2026/LIPIcs.ITCS.2026.8/LIPIcs.ITCS.2026.8.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":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7125509442.pdf","grobid_xml":"https://content.openalex.org/works/W7125509442.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Recently,":[0],"G\u00f6\u00f6s":[1],"et":[2,5,173],"al.":[3],"[G\u00f6\u00f6s":[4,172],"al.,":[6,174],"2024]":[7,175],"showed":[8],"that":[9,87,211],"Res":[10,37,103,132,182],"\u22cf":[11,183,213],"uSA":[12],"=":[13,185,215],"RevRes":[14,130],"in":[15,35,54,101,118,142,157,167,231,239],"the":[16,60,64,134,154,160,165,223],"following":[17],"sense:":[18],"if":[19,88],"a":[20,43,73,90,109,178,204,241],"formula":[21,91],"\u03c6":[22,46,92,112],"has":[23],"refutations":[24,95],"of":[25,47,63,78,96,111,113,146,153,181,225],"size":[26,48,97,114,126,158],"at":[27,32,49,98,115],"most":[28,33,50,99,116],"s":[29,100],"and":[30,38,75,104],"width/degree":[31],"w":[34],"both":[36,102],"uSA,":[39,105],"then":[40,106],"there":[41,93,107,138],"is":[42,108],"refutation":[44,110],"for":[45,89,133,136,197],"poly(s":[51],"\u22c5":[52],"2^w)":[53],"RevRes.":[55,119],"Their":[56],"proof":[57,66,77,180,195,244],"relies":[58],"on":[59],"TFNP":[61,205],"characterization":[62],"aforementioned":[65],"systems.":[67],"In":[68],"our":[69],"work,":[70],"we":[71,85,163,188,199,209],"give":[72],"direct":[74,179],"simplified":[76],"this":[79],"result,":[80],"simultaneously":[81],"achieving":[82],"better":[83],"bounds:":[84],"show":[86,210],"are":[94,139],"poly(s)":[117],"This":[120,144],"potentially":[121,242],"allows":[122,219],"us":[123,220],"to":[124,131,193,221,233],"\"lift\"":[125],"lower":[127,229,237],"bounds":[128,141,166,230,238],"from":[129,159,171],"formulas":[135],"which":[137,198,217],"upper":[140],"uSA.":[143],"kind":[145],"lifting":[147],"was":[148],"not":[149,202],"possible":[150],"before":[151],"because":[152],"exponential":[155],"blow-up":[156],"width.":[161],"Similarly,":[162],"improve":[164],"another":[168],"intersection":[169,191],"theorem":[170],"by":[176],"giving":[177],"uNS":[184],"RevResT.":[186],"Finally,":[187],"generalize":[189],"those":[190],"theorems":[192],"some":[194],"systems":[196],"currently":[200],"do":[201],"have":[203],"characterization.":[206],"For":[207],"example,":[208],"Res(\u2295)":[212,232],"u-wRes(\u2295)":[214],"RevRes(\u2295),":[216,240],"effectively":[218],"reduce":[222],"problem":[224],"proving":[226,234],"Pigeonhole":[227,235],"Principle":[228,236],"weaker":[243],"system.":[245]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-24T00:00:00"}