{"id":"https://openalex.org/W7118396827","doi":"https://doi.org/10.1137/1.9781611978971.70","title":"k-SUM Hardness Implies Treewidth-SETH","display_name":"k-SUM Hardness Implies Treewidth-SETH","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118396827","doi":"https://doi.org/10.1137/1.9781611978971.70"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.70","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.70","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059698872","display_name":"Michael Lampis","orcid":"https://orcid.org/0000-0002-5791-0887"},"institutions":[{"id":"https://openalex.org/I2746051580","display_name":"Universit\u00e9 Paris Sciences et Lettres","ror":"https://ror.org/013cjyk83","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Michael Lampis","raw_affiliation_strings":["PSL University"],"affiliations":[{"raw_affiliation_string":"PSL University","institution_ids":["https://openalex.org/I2746051580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059698872"],"corresponding_institution_ids":["https://openalex.org/I2746051580"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23317308,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1916","last_page":"1944"},"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.5475000143051147,"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.5475000143051147,"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.4120999872684479,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.005499999970197678,"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/treewidth","display_name":"Treewidth","score":0.6270999908447266},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4916999936103821},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48489999771118164},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.45159998536109924},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.44190001487731934},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.40369999408721924}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7451000213623047},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6270999908447266},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5758000016212463},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4916999936103821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4855000078678131},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48489999771118164},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.45159998536109924},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44190001487731934},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.40369999408721924},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.36959999799728394},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3528999984264374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34360000491142273},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C164680029","wikidata":"https://www.wikidata.org/wiki/Q1055293","display_name":"Multiple","level":2,"score":0.2549000084400177}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.70","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.70","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"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":{"We":[0,91],"show":[1],"that":[2,10],"if":[3,31],"\\(k\\)-SUM":[4,75],"is":[5,14,28,33,52,104],"hard,":[6],"in":[7,44,76],"the":[8,11,21,24,53,61,65,98],"sense":[9],"standard":[12],"algorithm":[13,40,72],"essentially":[15],"optimal,":[16],"then":[17,67],"a":[18,56,70],"variant":[19],"of":[20,55,60,64],"SETH":[22,27],"called":[23],"Primal":[25],"Treewidth":[26],"true.":[29],"Formally:":[30],"there":[32,68],"an":[34,39,94],"\\(\\varepsilon":[35],"\\gt":[36,84],"0\\)":[37,85],"and":[38,86],"which":[41,73],"solves":[42,74],"SAT":[43],"time":[45,77],"\\((2":[46],"-":[47,79],"\\varepsilon)^{\\mathrm{tw}}":[48],"|\\phi|^{O(1)}\\),":[49],"where":[50,101],"\\(\\mathrm{tw}\\)":[51],"width":[54],"given":[57],"tree":[58],"decomposition":[59],"primal":[62],"graph":[63],"input,":[66],"exists":[69],"randomized":[71],"\\(n^{(1":[78],"\\delta)\\frac{k}{2}}\\)":[80],"for":[81,97],"some":[82],"\\(\\delta":[83],"all":[87],"sufficiently":[88],"large":[89],"\\(k\\).":[90],"also":[92],"establish":[93],"analogous":[95],"result":[96],"\\(k\\)-XOR":[99],"problem,":[100],"integer":[102],"addition":[103,108],"replaced":[105],"by":[106],"component-wise":[107],"modulo":[109],"\\(2\\).":[110]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}