{"id":"https://openalex.org/W2404960361","doi":"https://doi.org/10.1145/2925416","title":"On Problems as Hard as CNF-SAT","display_name":"On Problems as Hard as CNF-SAT","publication_year":2016,"publication_date":"2016-05-24","ids":{"openalex":"https://openalex.org/W2404960361","doi":"https://doi.org/10.1145/2925416","mag":"2404960361"},"language":"en","primary_location":{"id":"doi:10.1145/2925416","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2925416","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052689442","display_name":"Holger Dell","orcid":"https://orcid.org/0000-0001-8955-0786"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Holger Dell","raw_affiliation_strings":["Saarland University and Cluster of Excellence (MMCI), Germany"],"affiliations":[{"raw_affiliation_string":"Saarland University and Cluster of Excellence (MMCI), Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210117195","display_name":"Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary","institution_ids":["https://openalex.org/I4210117195","https://openalex.org/I7597260"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Technische Universiteie Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Technische Universiteie Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080521209","display_name":"Yoshio Okamoto","orcid":"https://orcid.org/0000-0002-9826-7074"},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshio Okamoto","raw_affiliation_strings":["University of Electro-Communications, Japan"],"affiliations":[{"raw_affiliation_string":"University of Electro-Communications, Japan","institution_ids":["https://openalex.org/I20529979"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111512545","display_name":"Ramamohan Paturi","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramamohan Paturi","raw_affiliation_strings":["University of California, San Diego, USA"],"affiliations":[{"raw_affiliation_string":"University of California, San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["Institute of Mathematical Sciences, India"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, India","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001475076","display_name":"Magnus Wahlstr\u00f6m","orcid":"https://orcid.org/0000-0002-0933-4504"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Magnus Wahlstr\u00f6m","raw_affiliation_strings":["Royal Holloway, University of London, UK"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, UK","institution_ids":["https://openalex.org/I184558857"]}]}],"institutions":[],"countries_distinct_count":9,"institutions_distinct_count":9,"corresponding_author_ids":["https://openalex.org/A5037989463"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":14.6358,"has_fulltext":false,"cited_by_count":114,"citation_normalized_percentile":{"value":0.99014475,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"12","issue":"3","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.7053711414337158},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6246506571769714},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.596967875957489},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5486595630645752},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5061435103416443},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5026423931121826},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.494978129863739},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4678319990634918},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4472638964653015},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4204975664615631},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3071101903915405}],"concepts":[{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.7053711414337158},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6246506571769714},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.596967875957489},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5486595630645752},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5061435103416443},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5026423931121826},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.494978129863739},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4678319990634918},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4472638964653015},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4204975664615631},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3071101903915405},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2925416","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2925416","pdf_url":null,"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"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/b57b8556-5a24-490e-b260-a4b18604691d","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/b57b8556-5a24-490e-b260-a4b18604691d","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cygan, M, Dell, H, Lokshtanov, D, Marx, D, Nederlof, J, Okamoto, Y, Paturi, R, Saurabh, S & Wahlstr\u00f6m, M 2016, 'On problems as hard as CNF-SAT', ACM Transactions on Algorithms, vol. 12, no. 3, 41. https://doi.org/10.1145/2925416","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/b57b8556-5a24-490e-b260-a4b18604691d","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/b57b8556-5a24-490e-b260-a4b18604691d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 12(3):41. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2697509647","display_name":null,"funder_award_id":"N206 567140","funder_id":"https://openalex.org/F4320322650","funder_display_name":"Narodowym Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"},{"id":"https://openalex.org/F4320322650","display_name":"Narodowym Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W86440672","https://openalex.org/W1507039213","https://openalex.org/W1515598460","https://openalex.org/W1530008367","https://openalex.org/W1576180980","https://openalex.org/W1593947471","https://openalex.org/W1786652263","https://openalex.org/W1965381909","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2007200873","https://openalex.org/W2009147258","https://openalex.org/W2021372200","https://openalex.org/W2045326192","https://openalex.org/W2059273723","https://openalex.org/W2067983896","https://openalex.org/W2073025989","https://openalex.org/W2074359677","https://openalex.org/W2087638517","https://openalex.org/W2089718638","https://openalex.org/W2096495231","https://openalex.org/W2103164681","https://openalex.org/W2106793914","https://openalex.org/W2112624678","https://openalex.org/W2115147103","https://openalex.org/W2124435154","https://openalex.org/W2127028498","https://openalex.org/W2136595209","https://openalex.org/W2153667368","https://openalex.org/W2159892713","https://openalex.org/W2162561603","https://openalex.org/W2408366771","https://openalex.org/W2752885492","https://openalex.org/W2950987206","https://openalex.org/W4205778826"],"related_works":["https://openalex.org/W4214914101","https://openalex.org/W3196775331","https://openalex.org/W2256089709","https://openalex.org/W4313227037","https://openalex.org/W4307416302","https://openalex.org/W4287689012","https://openalex.org/W2913308506","https://openalex.org/W2521054645","https://openalex.org/W1540525943","https://openalex.org/W4287025685"],"abstract_inverted_index":{"The":[0,75,155],"field":[1],"of":[2,40,73,83,105,244,328,338,341],"exact":[3],"exponential":[4,31,157],"time":[5,32,95,122,158,195,230,309,352],"algorithms":[6,33,67,115,287],"for":[7,26,37,86,116,175,206,273,288,311,358],"non-deterministic":[8],"polynomial-time":[9],"hard":[10],"problems":[11,212],"has":[12],"thrived":[13],"since":[14],"the":[15,22,80,88,103,108,133,151,211,242,249,284,307,326,336,339],"mid-2000s.":[16],"While":[17,111],"exhaustive":[18,90],"search":[19,91],"remains":[20],"asymptotically":[21],"fastest":[23,285],"known":[24,286],"algorithm":[25,92,128,310],"some":[27,63],"basic":[28],"problems,":[29,41,253],"non-trivial":[30,114],"have":[34],"been":[35],"found":[36],"a":[38,84,138,168,182,262,270],"myriad":[39],"including":[42],"G":[43],"raph":[44],"C":[45,276,294,298,331,346],"oloring":[46],",":[47,52,57,217,222,293,300,305],"H":[48,213],"amiltonian":[49],"P":[50,303],"ath":[51],"D":[53],"ominating":[54],"S":[55,215,218,220,274,289,301,312,314,329,344],"et":[56,216,219,275,302,330,345],"and":[58,141,163,172,223,278,306],"3-CNF-S":[59],"at":[60,77,118,190,225],".":[61,199],"In":[62,200],"instances,":[64],"improving":[65],"these":[66,252],"further":[68,171],"seems":[69],"to":[70,131,137,146,259,343],"be":[71,192,227,317,349],"out":[72],"reach.":[74],"CNF-S":[76,117],"problem":[78,85],"is":[79,102,144,150,181,241],"canonical":[81],"example":[82],"which":[87],"trivial":[89],"runs":[93],"in":[94,107,121,194,229,248,261,351],"O":[96,231,353],"(2":[97,124,232,354],"n":[98,101,125,198,234,240,356],"),":[99,126],"where":[100],"number":[104,243,340],"variables":[106,247],"input":[109],"formula.":[110],"there":[112,180],"exist":[113],"that":[119,148,187,267,335],"run":[120],"o":[123],"no":[127],"was":[129],"able":[130],"improve":[132],"growth":[134,153],"rate":[135],"2":[136,149,196],"smaller":[139],"constant,":[140],"hence":[142],"it":[143],"natural":[145],"conjecture":[147,266],"optimal":[152],"rate.":[154],"strong":[156],"hypothesis":[159],"(SETH)":[160],"by":[161,333],"Impagliazzo":[162],"Paturi":[164],"[JCSS":[165],"2001]":[166],"goes":[167],"little":[169],"bit":[170],"asserts":[173],"that,":[174,205,280],"every":[176,207],"\u03f5":[177,197,208,233,355,360],"<":[178,209,361],"1,":[179,210],"(large)":[183],"integer":[184],"k":[185,188],"such":[186],"-CNF-S":[189],"cannot":[191,226,316,348],"computed":[193,228,350],"this":[201,282],"article,":[202],"we":[203,254,321],"show":[204],"itting":[214],"plitting":[221],"NAE-S":[224],")":[235,357],"unless":[236,363],"SETH":[237,260,268,364],"fails.":[238,365],"Here":[239],"elements":[245],"or":[246],"input.":[250],"For":[251],"actually":[255],"get":[256],"an":[257],"equivalence":[258],"certain":[263],"sense.":[264],"We":[265],"implies":[269],"similar":[271],"statement":[272],"over":[277,299,332,347],"prove":[279],"under":[281],"assumption,":[283],"teiner":[290],"T":[291],"ree":[292],"onnected":[295],"V":[296],"ertex":[297],"artitioning":[304],"pseudo-polynomial":[308],"ubset":[313],"um":[315],"significantly":[318],"improved.":[319],"Finally,":[320],"justify":[322],"our":[323],"assumption":[324],"about":[325],"hardness":[327],"showing":[334],"parity":[337],"solutions":[342],"any":[359],"1":[362]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-19T23:35:23.961156","created_date":"2025-10-10T00:00:00"}