{"id":"https://openalex.org/W2049136377","doi":"https://doi.org/10.1145/1066100.1066101","title":"An improved exponential-time algorithm for <i>k</i> -SAT","display_name":"An improved exponential-time algorithm for <i>k</i> -SAT","publication_year":2005,"publication_date":"2005-05-01","ids":{"openalex":"https://openalex.org/W2049136377","doi":"https://doi.org/10.1145/1066100.1066101","mag":"2049136377"},"language":"en","primary_location":{"id":"doi:10.1145/1066100.1066101","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066100.1066101","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/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":true,"raw_author_name":"Ramamohan Paturi","raw_affiliation_strings":["University of California San Diego, La Jolla, California","University of California , San Diego La Jolla, California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego, La Jolla, California","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California , San Diego La Jolla, California","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109848440","display_name":"Pavel Pudl\u00e1k","orcid":null},"institutions":[{"id":"https://openalex.org/I202391551","display_name":"Czech Academy of Sciences","ror":"https://ror.org/053avzc18","country_code":"CZ","type":"funder","lineage":["https://openalex.org/I202391551"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Pudl\u00e1k","raw_affiliation_strings":["Mathematical Institute, Academy of Sciences, Prague, Czech Republic","Mathematical Institute, Academy of Sciences, Prague, Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute, Academy of Sciences, Prague, Czech Republic","institution_ids":[]},{"raw_affiliation_string":"Mathematical Institute, Academy of Sciences, Prague, Czech Republic#TAB#","institution_ids":["https://openalex.org/I202391551"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030610930","display_name":"Michael Saks","orcid":"https://orcid.org/0000-0003-1659-7190"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael E. Saks","raw_affiliation_strings":["Rutgers University, Piscataway, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, New Jersey","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073436821","display_name":"Francis Zane","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Francis Zane","raw_affiliation_strings":["Bell Labs, Lucent Technologies, Murray Hill, NJ","[Bell Laboratories, Lucent Technologies, Murray Hill, NJ]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Labs, Lucent Technologies, Murray Hill, NJ","institution_ids":[]},{"raw_affiliation_string":"[Bell Laboratories, Lucent Technologies, Murray Hill, NJ]","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111512545"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":9.4442,"has_fulltext":false,"cited_by_count":215,"citation_normalized_percentile":{"value":0.98644947,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"52","issue":"3","first_page":"337","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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.9984999895095825,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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/combinatorics","display_name":"Combinatorics","score":0.6989496946334839},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6231493353843689},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6205378174781799},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6204733848571777},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.569501519203186},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5238195061683655},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.521727442741394},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5139924883842468},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4945344626903534},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48864036798477173},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47358542680740356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4509649872779846},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4352084696292877},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4342096447944641},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4330212473869324}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6989496946334839},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6231493353843689},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6205378174781799},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6204733848571777},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.569501519203186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5238195061683655},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.521727442741394},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5139924883842468},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4945344626903534},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48864036798477173},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47358542680740356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4509649872779846},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4352084696292877},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4342096447944641},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4330212473869324},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1066100.1066101","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1066100.1066101","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W282603215","https://openalex.org/W1508924483","https://openalex.org/W1509587667","https://openalex.org/W1530008367","https://openalex.org/W1564428908","https://openalex.org/W1606480398","https://openalex.org/W1984323815","https://openalex.org/W2014111643","https://openalex.org/W2036350017","https://openalex.org/W2057361103","https://openalex.org/W2066749637","https://openalex.org/W2068871408","https://openalex.org/W2097612342","https://openalex.org/W2115569665","https://openalex.org/W2126442135","https://openalex.org/W2134514766","https://openalex.org/W2165293955","https://openalex.org/W2171680292","https://openalex.org/W2561675875","https://openalex.org/W6646360147"],"related_works":["https://openalex.org/W3107131366","https://openalex.org/W2014111643","https://openalex.org/W1544998733","https://openalex.org/W1557481323","https://openalex.org/W3136261533","https://openalex.org/W2478852768","https://openalex.org/W1535039583","https://openalex.org/W2235115558","https://openalex.org/W2526609438","https://openalex.org/W2135364550"],"abstract_inverted_index":{"We":[0],"propose":[1],"and":[2],"analyze":[3],"a":[4,28,47,52,60,80,117,163,167,175,191],"simple":[5,53],"new":[6],"randomized":[7,54],"algorithm,":[8],"called":[9],"ResolveSat,":[10],"for":[11,59,71,75,89,100,197],"finding":[12],"satisfying":[13,61,111],"assignments":[14],"of":[15,25,40,42,83,144,148,159,162,203],"Boolean":[16,201],"formulas":[17],"in":[18,31,141],"conjunctive":[19],"normal":[20],"form.":[21],"The":[22,146],"algorithm":[23,70,99,150],"consists":[24],"two":[26],"stages:":[27],"preprocessing":[29],"stage":[30,49],"which":[32],"resolution":[33],"is":[34,65,94,171,207,214],"applied":[35,172],"to":[36,57,173],"enlarge":[37],"the":[38,43,66,95,142,149,157,160,208],"set":[39],"clauses":[41],"formula,":[44],"followed":[45],"by":[46,166],"search":[48],"that":[50,106,213],"uses":[51],"greedy":[55],"procedure":[56],"look":[58],"assignment.":[62],"Currently,":[63],"this":[64],"fastest":[67,96],"known":[68,97],"probabilistic":[69,98],"k":[72,76,101,103,114,168],"-CNF":[73],"satisfiability":[74],"\u2265":[77,104],"4":[78],"(with":[79,116],"running":[81,118],"time":[82,119],"O":[84,120,135],"(2":[85,121,122,136],"0.5625":[86],"n":[87,127,131,139,204],")":[88,132,133,140,196],"4-CNF).":[90],"In":[91,187],"addition,":[92],"it":[93],"-CNF,":[102],"3,":[105],"have":[107],"at":[108],"most":[109],"one":[110],"assignment":[112],"(unique":[113],"-SAT)":[115],"ln":[123],"2":[124,218],"\u2212":[125],"1)":[126],"+":[128,220],"o":[129,221],"(":[130],"=":[134],"0.386":[137],"\u2026":[138],"case":[143],"3-CNF).":[145],"analysis":[147],"also":[151],"gives":[152],"an":[153,198],"upper":[154],"bound":[155,193,212],"on":[156,178],"number":[158],"codewords":[161],"code":[164],"defined":[165],"-CNF.":[169],"This":[170,206],"prove":[174,190],"lower":[176,192,211],"bounds":[177],"depth":[179],"3":[180],"circuits":[181],"accepting":[182],"codes":[183],"with":[184],"nonconstant":[185],"distance.":[186],"particular":[188],"we":[189],"\u03a9(2":[194],"1.282\u2026\u221a&gt;i&lt;n&gt;/i&lt;":[195],"explicitly":[199],"given":[200],"function":[202],"variables.":[205],"first":[209],"such":[210],"asymptotically":[215],"bigger":[216],"than":[217],"\u221a&gt;i&lt;n&gt;/i&lt;":[219],"(\u221a&gt;i&lt;n&gt;/i&lt;)":[222],".":[223]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":8}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}