{"id":"https://openalex.org/W4413895517","doi":"https://doi.org/10.4086/toc.2025.v021a004","title":"Towards an Understanding of Polynomial Calculus : New Separations and Lower Bounds","display_name":"Towards an Understanding of Polynomial Calculus : New Separations and Lower Bounds","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4413895517","doi":"https://doi.org/10.4086/toc.2025.v021a004"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2025.v021a004","doi":"https://doi.org/10.4086/toc.2025.v021a004","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2025.v021a004","pdf_url":"https://theoryofcomputing.org/articles/v021a004/v021a004.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","jufo-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v021a004/v021a004.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yuval Filmus","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuval Filmus","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024267515","display_name":"Massimo Lauria","orcid":"https://orcid.org/0000-0003-4003-3168","observed_orcids":["https://orcid.org/0000-0003-4003-3168"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Massimo Lauria","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090900538","display_name":"Mladen Mik\u0161a","orcid":"https://orcid.org/0000-0002-5422-4267","observed_orcids":["https://orcid.org/0000-0002-5422-4267"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mladen Miksa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003633660","display_name":"Jakob Nordstr\u00f6m","orcid":"https://orcid.org/0000-0002-2700-4285","observed_orcids":["https://orcid.org/0000-0002-2700-4285"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jakob Nordstrom","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5014450397","display_name":"Marc Vinyals","orcid":"https://orcid.org/0000-0002-1487-445X","observed_orcids":["https://orcid.org/0000-0002-1487-445X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marc Vinyals","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.5842,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54751586,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"21","issue":"1","first_page":"1","last_page":"48"},"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.9688000082969666,"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.9688000082969666,"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.010200000368058681,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.004699999932199717,"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/polynomial-calculus","display_name":"polynomial calculus","score":0.9829999804496765},{"id":"https://openalex.org/keywords/tseitin-formulas","display_name":"Tseitin formulas","score":0.9300000071525574},{"id":"https://openalex.org/keywords/graph-expansion","display_name":"graph expansion","score":0.8629999756813049},{"id":"https://openalex.org/keywords/proof-complexity-lower-bounds","display_name":"proof complexity lower bounds","score":0.6140000224113464}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36585551500320435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34020984172821045}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4086/toc.2025.v021a004","doi":"https://doi.org/10.4086/toc.2025.v021a004","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2025.v021a004","pdf_url":"https://theoryofcomputing.org/articles/v021a004/v021a004.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","jufo-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire/868c1e42-375a-4ca4-9177-1d9a28f913ee","doi":null,"is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/868c1e42-375a-4ca4-9177-1d9a28f913ee","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Filmus, Y, Lauria, M, Mik\u0161a, M, Nordstr\u00f6m, J & Vinyals, M 2025, 'Towards an Understanding of Polynomial Calculus : New Separations and Lower Bounds', Theory of Computing, vol. 21, v021a004. https://doi.org/10.4086/toc.2025.v021a004","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:lup.lub.lu.se:27dfa428-ab8f-4630-aff6-bfba77b4f243","doi":null,"is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/27dfa428-ab8f-4630-aff6-bfba77b4f243","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1557-2862","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.4086/toc.2025.v021a004","doi":"https://doi.org/10.4086/toc.2025.v021a004","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2025.v021a004","pdf_url":"https://theoryofcomputing.org/articles/v021a004/v021a004.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","jufo-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2109279595","display_name":null,"funder_award_id":"FP7/2007-2013","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G2443758508","display_name":null,"funder_award_id":"279611","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3207356259","display_name":null,"funder_award_id":"2007\u20132013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3768028705","display_name":null,"funder_award_id":"621-2010-4797","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G393177772","display_name":null,"funder_award_id":"FP7 2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4109256727","display_name":null,"funder_award_id":"621-2012-5645","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G5165213571","display_name":"From Mathematical Logic To Applications","funder_award_id":"238381","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5702163051","display_name":null,"funder_award_id":"FP7/2007","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6336396887","display_name":"Proof Complexity and Efficient Computation","funder_award_id":"2016-00782","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G8686506987","display_name":"Understanding the Hardness of Theorem Proving","funder_award_id":"279611","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322015","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087"},{"id":"https://openalex.org/F4320322509","display_name":"Kungliga Tekniska H\u00f6gskolan","ror":"https://ror.org/026vcq606"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413895517.pdf","grobid_xml":"https://content.openalex.org/works/W4413895517.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W255293273","https://openalex.org/W343133375","https://openalex.org/W1262446233","https://openalex.org/W1505776303","https://openalex.org/W1523895317","https://openalex.org/W1559980198","https://openalex.org/W1592213313","https://openalex.org/W1944379106","https://openalex.org/W1965765215","https://openalex.org/W1974070050","https://openalex.org/W1988083342","https://openalex.org/W1993216347","https://openalex.org/W2021972008","https://openalex.org/W2036871172","https://openalex.org/W2044560939","https://openalex.org/W2053929306","https://openalex.org/W2056382067","https://openalex.org/W2069767473","https://openalex.org/W2071347463","https://openalex.org/W2071596701","https://openalex.org/W2084384424","https://openalex.org/W2093126960","https://openalex.org/W2093396771","https://openalex.org/W2098022011","https://openalex.org/W2126420408","https://openalex.org/W2132489129","https://openalex.org/W2134253979","https://openalex.org/W2142785340","https://openalex.org/W2164319662","https://openalex.org/W2170001390","https://openalex.org/W2217204207","https://openalex.org/W2397294658","https://openalex.org/W2478722229","https://openalex.org/W2496163386","https://openalex.org/W2946964791","https://openalex.org/W2950949012","https://openalex.org/W3128482754","https://openalex.org/W3184009482","https://openalex.org/W4211118908","https://openalex.org/W4311916238"],"related_works":["https://openalex.org/W7100471830","https://openalex.org/W7096101795","https://openalex.org/W2081172416","https://openalex.org/W7098783685","https://openalex.org/W2950949012","https://openalex.org/W2134253979","https://openalex.org/W3000150945","https://openalex.org/W2560814280","https://openalex.org/W2217204207","https://openalex.org/W7096737171"],"abstract_inverted_index":{"$":[0,1],"During":[2],"the":[3,18,36,50,61,75,178,231,236,250,253],"last":[4],"two":[5],"decades,":[6],"an":[7],"active":[8],"line":[9],"of":[10,21,35,64,77,238,245,252],"research":[11],"in":[12,83,166,249],"proof":[13,38,54],"complexity":[14,20,63],"has":[15,161],"been":[16],"into":[17,174],"space":[19,25,62,78,105,135,199,227],"proofs":[22,204],"and":[23,81,164,210,260],"how":[24],"is":[26,69,148,217],"related":[27,51,153],"to":[28,79,146,218],"other":[29],"measures.":[30],"By":[31],"now":[32],"these":[33,221],"aspects":[34],"resolution":[37,93],"system":[39,55],"are":[40,131],"fairly":[41],"well":[42,73],"understood,":[43],"but":[44,52,136],"many":[45,65],"open":[46],"problems":[47],"remain":[48],"for":[49,122,134,139,150,230],"stronger":[53],"polynomial":[56],"calculus":[57],"(PC/PCR).":[58],"For":[59],"instance,":[60],"standard":[66],"\u201cbenchmark":[67],"formulas\u201d":[68],"still":[70],"open,":[71],"as":[72,74],"relation":[76],"size":[80],"degree":[82,116],"PC/PCR.":[84],"We":[85],"prove":[86],"that":[87,115,130,157,220],"if":[88,158,165],"a":[89,100,119,142,159],"formula":[90,101,180],"requires":[91,184],"large":[92,103,185],"width,":[94],"then":[95,177],"making":[96],"XOR":[97],"substitution":[98],"yields":[99,128],"requiring":[102],"PCR":[104,186],"(and":[106],"hence":[107],"also":[108],"PC":[109],"space),":[110],"providing":[111],"some":[112],"circumstantial":[113],"evidence":[114],"might":[117],"be":[118,172],"lower":[120,228],"bound":[121],"space.":[123,187],"More":[124],"importantly,":[125],"this":[126,182,239,246],"immediately":[127],"formulas":[129,191],"very":[132,137],"hard":[133],"easy":[138],"size,":[140],"exhibiting":[141],"size-space":[143],"separation":[144],"similar":[145],"what":[147],"known":[149],"resolution.":[151],"Using":[152],"ideas,":[154],"we":[155],"show":[156,219],"graph":[160,183],"good":[162],"expansion":[163],"addition":[167],"its":[168],"edge":[169],"set":[170],"can":[171],"partitioned":[173],"short":[175],"cycles,":[176],"Tseitin":[179,190],"over":[181,192],"In":[188],"particular,":[189],"random":[193],"$4$-regular":[194],"graphs":[195],"almost":[196],"surely":[197],"require":[198],"at":[200],"least":[201],"$\\Omega(\\sqrt{n})$.":[202],"Our":[203,213],"use":[205],"techniques":[206,222],"introduced":[207],"by":[208],"Bonacina":[209],"Galesi":[211],"(ITCS'13).":[212],"final":[214],"contribution,":[215],"however,":[216],"provably":[223],"cannot":[224],"yield":[225],"non-constant":[226],"bounds":[229],"functional":[232],"pigeonhole":[233],"principle,":[234],"delineating":[235],"limitations":[237],"framework.":[240],"-------------------":[241],"An":[242],"extended":[243],"abstract":[244],"paper":[247],"appeared":[248],"Proceedings":[251],"40th":[254],"International":[255],"Colloquium":[256],"on":[257],"Automata,":[258],"Languages":[259],"Programming":[261],"(ICALP'13).":[262]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2025-09-02T00:00:00"}
