{"id":"https://openalex.org/W2395370258","doi":"https://doi.org/10.1145/2975386","title":"The Local Lemma Is Asymptotically Tight for SAT","display_name":"The Local Lemma Is Asymptotically Tight for SAT","publication_year":2016,"publication_date":"2016-12-06","ids":{"openalex":"https://openalex.org/W2395370258","doi":"https://doi.org/10.1145/2975386","mag":"2395370258"},"language":"en","primary_location":{"id":"doi:10.1145/2975386","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2975386","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/A5044963823","display_name":"Heidi Gebauer","orcid":"https://orcid.org/0000-0002-7616-3821"},"institutions":[{"id":"https://openalex.org/I858936495","display_name":"ZHAW Zurich University of Applied Sciences","ror":"https://ror.org/05pmsvm27","country_code":"CH","type":"education","lineage":["https://openalex.org/I858936495"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Heidi Gebauer","raw_affiliation_strings":["Zurich University of Applied Sciences"],"raw_orcid":"https://orcid.org/0000-0002-7616-3821","affiliations":[{"raw_affiliation_string":"Zurich University of Applied Sciences","institution_ids":["https://openalex.org/I858936495"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068960247","display_name":"Tibor Szab\u00f3","orcid":"https://orcid.org/0000-0003-0599-0624"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tibor Szab\u00f3","raw_affiliation_strings":["Freie Universit\u00e4t Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Freie Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031444562","display_name":"G\u00e1bor Tardos","orcid":"https://orcid.org/0000-0002-4281-1843"},"institutions":[{"id":"https://openalex.org/I127817813","display_name":"Alfr\u00e9d R\u00e9nyi Institute of Mathematics","ror":"https://ror.org/03vw74f64","country_code":"HU","type":"facility","lineage":["https://openalex.org/I127817813","https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G\u00e1bor Tardos","raw_affiliation_strings":["R\u00e9nyi Institute, Budapest, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"R\u00e9nyi Institute, Budapest, Hungary","institution_ids":["https://openalex.org/I127817813"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8836,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.91367562,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"63","issue":"5","first_page":"1","last_page":"32"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976000189781189,"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/lemma","display_name":"Lemma (botany)","score":0.719894289970398},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6761019229888916},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.523124635219574},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4862059950828552},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.47463664412498474},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4567611515522003},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.45097464323043823},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4395871162414551},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4229682385921478},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1340864896774292}],"concepts":[{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.719894289970398},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6761019229888916},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.523124635219574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4862059950828552},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.47463664412498474},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4567611515522003},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.45097464323043823},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4395871162414551},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4229682385921478},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1340864896774292},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2975386","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2975386","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":[{"id":"https://openalex.org/G6201474122","display_name":null,"funder_award_id":"K-116769 and SNN-117879","funder_id":"https://openalex.org/F4320326762","funder_display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal"}],"funders":[{"id":"https://openalex.org/F4320326762","display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1506918933","https://openalex.org/W1519477091","https://openalex.org/W1525293204","https://openalex.org/W1527607312","https://openalex.org/W1568383619","https://openalex.org/W1782236248","https://openalex.org/W1957114827","https://openalex.org/W1964239594","https://openalex.org/W1979831715","https://openalex.org/W1983085249","https://openalex.org/W2000171675","https://openalex.org/W2002353129","https://openalex.org/W2003979824","https://openalex.org/W2008120342","https://openalex.org/W2015211698","https://openalex.org/W2036265926","https://openalex.org/W2038225707","https://openalex.org/W2038872483","https://openalex.org/W2039241885","https://openalex.org/W2044712489","https://openalex.org/W2044983583","https://openalex.org/W2045502027","https://openalex.org/W2047290604","https://openalex.org/W2057577896","https://openalex.org/W2066022804","https://openalex.org/W2109693504","https://openalex.org/W2143996311","https://openalex.org/W2163543752","https://openalex.org/W2171001921","https://openalex.org/W2962941898","https://openalex.org/W3121437753","https://openalex.org/W4230867389"],"related_works":["https://openalex.org/W3006682748","https://openalex.org/W1097487277","https://openalex.org/W2768610039","https://openalex.org/W4308265086","https://openalex.org/W2949964783","https://openalex.org/W2106889256","https://openalex.org/W2801357573","https://openalex.org/W2982363256","https://openalex.org/W2974000959","https://openalex.org/W3150861763"],"abstract_inverted_index":{"The":[0,29,103,125,171,208,242,256],"Local":[1,63,105],"Lemma":[2,64],"is":[3,35,121,131,178,263],"a":[4,44,146,155,230,251,294,298,322],"fundamental":[5],"tool":[6],"of":[7,32,39,46,56,111,127,173,185,198,211,223,235,253,258,301,321,332],"probabilistic":[8],"combinatorics":[9],"and":[10,87,188,293,318],"theoretical":[11],"computer":[12],"science,":[13],"yet":[14,305],"there":[15],"are":[16,193,238,247],"hardly":[17],"any":[18],"natural":[19],"problems":[20,283],"known":[21],"where":[22,61,80,139],"it":[23,135,157],"provides":[24],"an":[25,109,219],"asymptotically":[26,122,243,277],"tight":[27],"answer.":[28],"main":[30,72,209],"theme":[31],"our":[33,71,174,212],"article":[34],"to":[36,52,115,165,229,240],"identify":[37],"several":[38],"these":[40],"problems,":[41],"among":[42],"them":[43],"couple":[45],"widely":[47],"studied":[48],"extremal":[49,129],"functions":[50],"related":[51],"certain":[53],"restricted":[54],"versions":[55],"the":[57,62,137,140,181,190,195,224,233,259,285,311,315,329],"k":[58,77,84,99,101,142,323],"-SAT":[59,143],"problem,":[60],"does":[65],"give":[66,276],"essentially":[67],"optimal":[68,244],"answers.":[69],"As":[70,304],"contribution,":[73],"we":[74,237,308],"construct":[75],"unsatisfiable":[76,175,200],"-CNF":[78],"formulas":[79,177,192,201],"every":[81,88,152],"clause":[82,205],"has":[83],"distinct":[85],"literals":[86],"variable":[89,164],"appears":[90],"in":[91,167,194,216,269,328],"at":[92],"most":[93],"2/e":[94],"+":[95],"o":[96],"(1))":[97],"2":[98],"/":[100],"clauses.":[102],"Lopsided":[104],"Lemma,":[106],"applied":[107],"with":[108],"assignment":[110],"random":[112],"values":[113],"according":[114],"counterintuitive":[116],"probabilities,":[117],"shows":[118],"that":[119],"this":[120,128,254],"best":[123],"possible.":[124],"determination":[126],"function":[130],"particularly":[132],"important,":[133],"as":[134],"represents":[136],"value":[138],"corresponding":[141],"problem":[144,296],"exhibits":[145],"complexity":[147],"hardness":[148],"jump:":[149],"From":[150],"having":[151,202],"instance":[153],"being":[154],"YES-instance":[156],"becomes":[158],"NP-hard":[159],"just":[160],"by":[161,266,290],"allowing":[162,297],"each":[163],"occur":[166],"one":[168,203],"more":[169,204],"clause.":[170],"construction":[172],"CNF":[176],"based":[179],"on":[180,314],"binary":[182,245,260],"tree":[183],"approach":[184,213],"Gebauer":[186],"[2012],":[187],"thus":[189],"constructed":[191,262],"class":[196],"MU(1)":[197],"minimal":[199],"than":[206],"variables.":[207],"novelty":[210],"here":[214],"comes":[215],"setting":[217],"up":[218],"appropriate":[220],"continuous":[221],"approximation":[222],"problem.":[225],"This":[226],"leads":[227],"us":[228],"differential":[231],"equation,":[232],"solution":[234],"which":[236],"able":[239],"estimate.":[241],"trees":[246,261],"then":[248],"obtained":[249],"through":[250],"discretization":[252],"solution.":[255],"importance":[257],"also":[264],"underlined":[265],"their":[267],"appearance":[268],"many":[270],"other":[271],"scenarios.":[272],"In":[273],"particular,":[274],"they":[275],"precise":[278],"answers":[279],"for":[280],"seemingly":[281],"unrelated":[282],"like":[284],"European":[286],"Tenure":[287],"Game":[288],"introduced":[289],"Doerr":[291],"[2004]":[292],"search":[295],"limited":[299],"number":[300],"consecutive":[302],"lies.":[303],"another":[306],"consequence,":[307],"slightly":[309],"improve":[310],"best-known":[312],"bounds":[313],"maximum":[316,319],"degree":[317],"edge-degree":[320],"-uniform":[324],"Maker\u2019s":[325],"win":[326],"hypergraph":[327],"Neighborhood":[330],"Conjecture":[331],"Beck.":[333]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}