{"id":"https://openalex.org/W4408150749","doi":"https://doi.org/10.1145/3721134","title":"Polynomial Formulations as a Barrier for Reduction-Based Hardness Proofs","display_name":"Polynomial Formulations as a Barrier for Reduction-Based Hardness Proofs","publication_year":2025,"publication_date":"2025-03-04","ids":{"openalex":"https://openalex.org/W4408150749","doi":"https://doi.org/10.1145/3721134"},"language":"en","primary_location":{"id":"doi:10.1145/3721134","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3721134","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3721134","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3721134","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103158341","display_name":"Tatiana Belova","orcid":"https://orcid.org/0009-0009-5605-5485"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]},{"id":"https://openalex.org/I2800906181","display_name":"St. Petersburg Department of Steklov Institute of Mathematics","ror":"https://ror.org/030h9s280","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2800906181","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Tatiana Belova","raw_affiliation_strings":["Steklov Institute of Mathematics, St. Petersburg, Russia and ITMO University, St. Petersburg, Russia","Steklov Institute of Mathematics at St. Petersburg, Russia and ITMO University, Russia"],"raw_orcid":"https://orcid.org/0009-0009-5605-5485","affiliations":[{"raw_affiliation_string":"Steklov Institute of Mathematics, St. Petersburg, Russia and ITMO University, St. Petersburg, Russia","institution_ids":["https://openalex.org/I2800906181"]},{"raw_affiliation_string":"Steklov Institute of Mathematics at St. Petersburg, Russia and ITMO University, Russia","institution_ids":["https://openalex.org/I173089394","https://openalex.org/I2800906181"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062090877","display_name":"Alexander Golovnev","orcid":"https://orcid.org/0000-0002-7847-1027"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Golovnev","raw_affiliation_strings":["Computer Science, Georgetown University, Washington, District of Columbia, USA","Georgetown University, USA"],"raw_orcid":"https://orcid.org/0000-0002-7847-1027","affiliations":[{"raw_affiliation_string":"Computer Science, Georgetown University, Washington, District of Columbia, USA","institution_ids":["https://openalex.org/I184565670"]},{"raw_affiliation_string":"Georgetown University, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045174507","display_name":"Alexander S. Kulikov","orcid":"https://orcid.org/0000-0002-5656-0336"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander S. Kulikov","raw_affiliation_strings":["Georgetown University, Washington, District of Columbia, USA","JetBrains Research, Cyprus"],"raw_orcid":"https://orcid.org/0000-0002-5656-0336","affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, District of Columbia, USA","institution_ids":["https://openalex.org/I184565670"]},{"raw_affiliation_string":"JetBrains Research, Cyprus","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060506774","display_name":"Ivan Mihajlin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ivan Mihajlin","raw_affiliation_strings":["JetBrains Research, Limassol, Cyprus","JetBrains Research, Cyprus"],"raw_orcid":"https://orcid.org/0009-0000-1019-5719","affiliations":[{"raw_affiliation_string":"JetBrains Research, Limassol, Cyprus","institution_ids":[]},{"raw_affiliation_string":"JetBrains Research, Cyprus","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090623773","display_name":"Denil Sharipov","orcid":null},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Denil Sharipov","raw_affiliation_strings":["St Petersburg State University, St. Petersburg, Russian Federation","St. Petersburg State University, Russia"],"raw_orcid":"https://orcid.org/0009-0009-7411-1671","affiliations":[{"raw_affiliation_string":"St Petersburg State University, St. Petersburg, Russian Federation","institution_ids":["https://openalex.org/I172901346"]},{"raw_affiliation_string":"St. Petersburg State University, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"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.04451198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"4","first_page":"1","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7956878542900085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6788010001182556},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6098974943161011},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5521246790885925},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4828272759914398},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.48130905628204346},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47986310720443726},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4767219126224518},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.46774154901504517},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45640599727630615},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4498422145843506},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39497554302215576},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3331717848777771}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7956878542900085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6788010001182556},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6098974943161011},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5521246790885925},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4828272759914398},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.48130905628204346},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47986310720443726},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4767219126224518},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.46774154901504517},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45640599727630615},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4498422145843506},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39497554302215576},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3331717848777771},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3721134","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3721134","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3721134","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3721134","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3721134","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3721134","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8027353509","display_name":null,"funder_award_id":"075-15-2022-289","funder_id":"https://openalex.org/F4320327755","funder_display_name":"Foundation for the Advancement of Theoretical Physics and Mathematics"}],"funders":[{"id":"https://openalex.org/F4320327755","display_name":"Foundation for the Advancement of Theoretical Physics and Mathematics","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4408150749.pdf"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W201320490","https://openalex.org/W1527197079","https://openalex.org/W1822472214","https://openalex.org/W1852383912","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1974331311","https://openalex.org/W1994289991","https://openalex.org/W2003753063","https://openalex.org/W2015963099","https://openalex.org/W2026771935","https://openalex.org/W2026944800","https://openalex.org/W2044452930","https://openalex.org/W2047489708","https://openalex.org/W2055693471","https://openalex.org/W2074359677","https://openalex.org/W2074728115","https://openalex.org/W2084732238","https://openalex.org/W2122270497","https://openalex.org/W2153715991","https://openalex.org/W2159341052","https://openalex.org/W2174231092","https://openalex.org/W2249739104","https://openalex.org/W2296148711","https://openalex.org/W2404960361","https://openalex.org/W2800485060","https://openalex.org/W2908533878","https://openalex.org/W2914414140","https://openalex.org/W2963410133"],"related_works":["https://openalex.org/W2400752627","https://openalex.org/W2950838401","https://openalex.org/W2767174160","https://openalex.org/W4297689169","https://openalex.org/W2295534309","https://openalex.org/W2953291322","https://openalex.org/W4296116869","https://openalex.org/W2108136433","https://openalex.org/W4286853492","https://openalex.org/W2122202324"],"abstract_inverted_index":{"The":[0,24],"Strong":[1],"Exponential":[2],"Time":[3],"Hypothesis":[4],"(SETH)":[5],"asserts":[6],"that":[7,17,99,202,214],"for":[8,39,76,111,126,134,158,175],"every":[9,159],"\\(\\varepsilon":[10],">":[11,114,161],"0\\)":[12],"there":[13],"exists":[14],"k":[15,18,89,185],"such":[16,80,218],"-SAT":[19],"requires":[20],"time":[21],"\\((2-\\varepsilon)^{n}\\)":[22],".":[23,186],"field":[25],"of":[26,41,106,138,154,173,178],"fine-grained":[27,100,167],"complexity":[28,47],"has":[29,63],"leveraged":[30],"SETH":[31,110],"to":[32,151],"prove":[33],"quite":[34],"tight":[35],"conditional":[36],"lower":[37,121,124,132,171,229],"bounds":[38,125,133,172],"dozens":[40],"problems":[42,79,108,179,204],"in":[43,67],"various":[44],"domains":[45],"and":[46,58,91,213],"classes,":[48],"including":[49],"Edit":[50],"Distance,":[51],"Graph":[52],"Diameter,":[53],"Hitting":[54],"Set,":[55,57,85],"Independent":[56,84],"Orthogonal":[59],"Vectors.":[60],"Yet,":[61],"it":[62],"been":[64],"repeatedly":[65],"asked":[66],"the":[68,152,182],"literature":[69],"whether":[70],"SETH-hardness":[71],"results":[72],"can":[73,205],"be":[74,206,222],"proven":[75,223],"other":[77],"fundamental":[78],"as":[81],"Hamiltonian":[82],"Path,":[83],"Chromatic":[86],"Number,":[87],"MAX-":[88],"-SAT,":[90],"Set":[92],"Cover.":[93],"In":[94,198],"this":[95,148],"article,":[96],"we":[97,163,200],"show":[98,201],"reductions":[101,168],"implying":[102,169],"even":[103],"\\(\\lambda^{n}\\)":[104],"-hardness":[105],"these":[107],"from":[109],"any":[112,215],"\\(\\lambda":[113,160],"1\\)":[115,162],",":[116],"would":[117],"imply":[118],"new":[119,193,227],"circuit":[120,228],"bounds:":[122],"super-linear":[123],"Boolean":[127],"series-parallel":[128],"circuits":[129,136],"or":[130],"polynomial":[131,196],"arithmetic":[135],"(each":[137],"which":[139],"is":[140,191],"a":[141,176,192,219],"four-decade":[142],"open":[143],"question).":[144],"We":[145],"also":[146],"extend":[147],"barrier":[149],"result":[150],"class":[153],"parameterized":[155,180],"problems.":[156],"Namely,":[157],"conditionally":[164],"rule":[165],"out":[166],"SETH-based":[170],"\\(\\lambda^{k}\\)":[174],"number":[177],"by":[181,208],"solution":[183],"size":[184],"Our":[187],"main":[188],"technical":[189],"tool":[190],"concept":[194],"called":[195],"formulations.":[197],"particular,":[199],"many":[203],"represented":[207],"relatively":[209],"succinct":[210],"low-degree":[211],"polynomials,":[212],"problem":[216],"with":[217],"representation":[220],"cannot":[221],"SETH-hard":[224],"(without":[225],"proving":[226],"bounds).":[230]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}