{"id":"https://openalex.org/W2593370540","doi":"https://doi.org/10.1137/140989728","title":"Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem","display_name":"Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2593370540","doi":"https://doi.org/10.1137/140989728","mag":"2593370540"},"language":"en","primary_location":{"id":"doi:10.1137/140989728","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140989728","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5031648070","display_name":"David Gamarnik","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Gamarnik","raw_affiliation_strings":["Operations Research Center and Sloan School of Management, MIT, Cambridge, MA 02140"],"affiliations":[{"raw_affiliation_string":"Operations Research Center and Sloan School of Management, MIT, Cambridge, MA 02140","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":null,"type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":["Microsoft Research New England, Cambridge, MA 02142"],"affiliations":[{"raw_affiliation_string":"Microsoft Research New England, Cambridge, MA 02142","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031648070"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6314,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.91003781,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"46","issue":"2","first_page":"590","last_page":"619"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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.9962000250816345,"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/algorithm","display_name":"Algorithm","score":0.622336745262146},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.5946119427680969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.579776406288147},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5365652441978455},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4946241080760956},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.49018627405166626},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.4627290964126587},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.460018128156662},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.425301730632782},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4233614206314087},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2805778682231903}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.622336745262146},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.5946119427680969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.579776406288147},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5365652441978455},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4946241080760956},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.49018627405166626},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.4627290964126587},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.460018128156662},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.425301730632782},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4233614206314087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2805778682231903},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"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":1,"locations":[{"id":"doi:10.1137/140989728","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140989728","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4522565219","display_name":null,"funder_award_id":"CMMI-1335155","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5808922519","display_name":"Local Algorithms for Random Networks: Power, Limitations and Applications","funder_award_id":"1335155","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5954070948","display_name":null,"funder_award_id":"CMMI-","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W251413274","https://openalex.org/W1518885151","https://openalex.org/W1818081266","https://openalex.org/W1973744137","https://openalex.org/W2019186869","https://openalex.org/W2069603099","https://openalex.org/W2088419249","https://openalex.org/W2100008268","https://openalex.org/W2163712938","https://openalex.org/W2168290833","https://openalex.org/W2500308345","https://openalex.org/W2570121038","https://openalex.org/W2621271919","https://openalex.org/W2950654313","https://openalex.org/W3101681745"],"related_works":["https://openalex.org/W3034924094","https://openalex.org/W3094954546","https://openalex.org/W1488708774","https://openalex.org/W1982811510","https://openalex.org/W4391100477","https://openalex.org/W2402189625","https://openalex.org/W4327779705","https://openalex.org/W4310560702","https://openalex.org/W1513698804","https://openalex.org/W2029712093"],"abstract_inverted_index":{"We":[0,149,195],"formalize":[1],"the":[2,22,27,41,47,80,109,125,141,153,158,177,186,261,267,276],"class":[3],"of":[4,21,29,43,89,111,127,140,144,161,163,179,222,254,270,279],"\u201csequential":[5],"local":[6,60,71,74,202,256],"algorithms\"":[7],"and":[8,45,76,236],"show":[9,150,197],"that":[10,64,151,198,264],"these":[11,115,225],"algorithms":[12,61,91,116],"fail":[13],"to":[14,119,229,241,275],"find":[15],"satisfying":[16,169,208,281],"assignments":[17,170,188],"on":[18,69,79,136,182],"random":[19,146,271],"instances":[20],"\u201cNot-All-Equal-$K$-SAT\u201d":[23],"(NAE-$K$-SAT)":[24],"problem":[25],"if":[26,46,199],"number":[28,42,110,126],"message":[30],"passing":[31],"iterations":[32],"is":[33,50,117,134,260],"bounded":[34,212],"by":[35],"a":[36,145,172,200,207,230,244,250],"function":[37],"moderately":[38,123],"growing":[39,121],"in":[40,114,176,205,249],"variables":[44,67],"clause-to-variable":[48],"ratio":[49],"above":[51,152],"$(1+o_K(1)){2^{K-1}\\over":[52,154],"K}\\ln^2":[53,155],"K$":[54,156],"for":[55,189],"sufficiently":[56],"large":[57],"$K$.":[58],"Sequential":[59],"are":[62],"those":[63],"iteratively":[65],"set":[66],"based":[68,135],"some":[70,86,180],"information":[72],"and/or":[73],"randomness":[75],"then":[77,216],"recurse":[78],"reduced":[81],"instance.":[82],"Our":[83],"model":[84],"captures":[85],"weak":[87],"abstractions":[88],"natural":[90],"such":[92],"as":[93,97,99],"Survey":[94],"Propagation":[95,101],"(SP)-guided":[96],"well":[98],"Belief":[100],"(BP)-guided":[102],"decimation":[103],"algorithms---two":[104],"widely":[105],"studied":[106],"message-passing--based":[107],"algorithms---when":[108],"message-passing":[112],"rounds":[113],"restricted":[118],"be":[120],"only":[122],"with":[124,210,233],"variables.":[128],"The":[129],"approach":[130,246],"underlying":[131],"our":[132],"paper":[133],"an":[137,166,220],"intricate":[138],"geometry":[139],"solution":[142],"space":[143],"NAE-$K$-SAT":[147],"problem.":[148],"threshold,":[157],"overlap":[159,268],"structure":[160],"$m$-tuples":[162],"nearly":[164],"(in":[165],"appropriate":[167],"sense)":[168],"exhibit":[171],"certain":[173],"behavior":[174],"expressed":[175],"form":[178],"constraints":[181],"pairwise":[183],"distances":[184],"between":[185],"$m$":[187],"appropriately":[190],"chosen":[191],"positive":[192],"integer":[193],"$m$.":[194],"further":[196],"sequential":[201],"algorithm":[203],"succeeds":[204],"finding":[206,280],"assignment":[209],"probability":[211],"away":[213],"from":[214],"zero,":[215],"one":[217],"can":[218],"construct":[219],"$m$-tuple":[221],"solutions":[223],"violating":[224],"constraints,":[226],"thus":[227],"leading":[228],"contradiction.":[231],"Along":[232],"[D.":[234],"Gamarnik":[235],"M.":[237],"Sudan,":[238],"Ann.":[239],"Probab.,":[240],"appear],":[242],"where":[243],"similar":[245],"was":[247],"used":[248],"(somewhat":[251],"simpler)":[252],"setting":[253],"nonsequential":[255],"algorithms,":[257],"this":[258],"result":[259],"first":[262],"work":[263],"directly":[265],"links":[266],"property":[269],"constraint":[272],"satisfaction":[273],"problems":[274],"computational":[277],"hardness":[278],"assignments.":[282]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}