{"id":"https://openalex.org/W24795404","doi":"https://doi.org/10.1109/sfcs.2003.1238209","title":"Linear Upper Bounds for Random Walk on Small Density Random 3\u2010CNFs","display_name":"Linear Upper Bounds for Random Walk on Small Density Random 3\u2010CNFs","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W24795404","doi":"https://doi.org/10.1109/sfcs.2003.1238209","mag":"24795404"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238209","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-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/A5108192310","display_name":"Michael Alekhnovich","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mikhail Alekhnovich","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5058111762","display_name":"Eli Ben\u2010Sasson","orcid":"https://orcid.org/0000-0002-0708-0483"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eli Ben\u2010Sasson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7311,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82850372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2285","issue":"5","first_page":"1248","last_page":"1263"},"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.9878000020980835,"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.9878000020980835,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9266999959945679,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/random-walk","display_name":"Random walk","score":0.6970691084861755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5342990756034851},{"id":"https://openalex.org/keywords/statistical-physics","display_name":"Statistical physics","score":0.3826637864112854},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36787575483322144},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3297419548034668},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.19461357593536377},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.15346476435661316}],"concepts":[{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.6970691084861755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5342990756034851},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.3826637864112854},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36787575483322144},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3297419548034668},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.19461357593536377},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.15346476435661316}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/sfcs.2003.1238209","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"doi:10.1137/s0097539704440107","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704440107","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"},{"id":"mag:24795404","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc11.html#ECCC-TR04-016","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":"Electronic colloquium on computational complexity","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.112.4845","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.4845","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ias.edu/~misha/papers/rwalk.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.840","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.harvard.edu/~eli/papers/rwalksat-focs-final.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W67367170","https://openalex.org/W1518885151","https://openalex.org/W1534832769","https://openalex.org/W1559492868","https://openalex.org/W1587069206","https://openalex.org/W1820801893","https://openalex.org/W1969966778","https://openalex.org/W1999678910","https://openalex.org/W2024060531","https://openalex.org/W2051580875","https://openalex.org/W2054387247","https://openalex.org/W2055758906","https://openalex.org/W2063292248","https://openalex.org/W2066749637","https://openalex.org/W2072802070","https://openalex.org/W2126420408","https://openalex.org/W2126442135","https://openalex.org/W2131459042","https://openalex.org/W2136558174","https://openalex.org/W2143404729","https://openalex.org/W2155218845","https://openalex.org/W2164346692","https://openalex.org/W2166602562","https://openalex.org/W4231916799","https://openalex.org/W4233413206","https://openalex.org/W4242993568","https://openalex.org/W4249343322","https://openalex.org/W6601729634","https://openalex.org/W6609265319","https://openalex.org/W6630466005","https://openalex.org/W6637229586","https://openalex.org/W6641350426","https://openalex.org/W6654588864","https://openalex.org/W6657651502"],"related_works":["https://openalex.org/W206140123","https://openalex.org/W3098652117","https://openalex.org/W2051922466","https://openalex.org/W2155746626","https://openalex.org/W3103769422","https://openalex.org/W2080968375","https://openalex.org/W2950836258","https://openalex.org/W2147905284","https://openalex.org/W2063428816","https://openalex.org/W2034735560","https://openalex.org/W3040446770","https://openalex.org/W2008209980","https://openalex.org/W2290281599","https://openalex.org/W2018891134","https://openalex.org/W168261126","https://openalex.org/W2117829890","https://openalex.org/W2963839515","https://openalex.org/W2170807097","https://openalex.org/W3103061953","https://openalex.org/W3005609084"],"abstract_inverted_index":{"We":[0,79,124],"analyze":[1],"the":[2,5,19,34,40,97,103,107,112,126,129,141,159,184,194,199,225,229,244],"efficiency":[3],"of":[4,22,43,66,106,128,140,158,210,228,243],"random":[6,10,49,98,246],"walk":[7,99,247],"algorithm":[8,24,47],"on":[9,18,39,48,146,164,193],"3\u2010CNF":[11],"instances":[12],"and":[13,137,152,155,170,232],"prove":[14],"linear":[15,220],"upper":[16,37],"bounds":[17],"running":[20,41,241],"time":[21,42,242],"this":[23],"for":[25,59,116,173,239],"small":[26,174],"clause":[27,114,175],"density,":[28],"less":[29],"than":[30],"$1.63$.":[31],"This":[32,69,101,222],"is":[33,74,90,111,189,212],"first":[35],"subexponential":[36],"bound":[38,192],"a":[44,54,72,75,85,190],"local":[45],"improvement":[46],"instances.":[50],"Our":[51],"proof":[52],"introduces":[53],"simple,":[55],"yet":[56],"powerful":[57],"tool":[58],"analyzing":[60],"such":[61,118],"algorithms,":[62],"which":[63,110,117],"may":[64],"be":[65,93,203,216],"further":[67],"use.":[68],"object,":[70],"called":[71],"terminator,":[73],"weighted":[76],"satisfying":[77],"assignment.":[78],"show":[80,171,182],"that":[81,172,183,213],"any":[82],"CNF":[83],"having":[84],"good":[86,177],"(small":[87],"weight)":[88],"terminator":[89,108,195,200,230],"assured":[91],"to":[92,202],"solved":[94],"quickly":[95],"by":[96,134],"algorithm.":[100],"raises":[102],"natural":[104],"question":[105],"threshold":[109,187,201,231],"maximal":[113],"density":[115],"assignments":[119],"exist":[120],"(with":[121],"high":[122],"probability).":[123],"use":[125],"analysis":[127],"pure":[130,185],"literal":[131,186],"heuristic":[132],"presented":[133],"Broder,":[135],"Frieze,":[136],"Upfal":[138],"[Proceedings":[139,157],"Fourth":[142],"Annual":[143,161],"ACM\u2010SIAM":[144,162],"Symposium":[145,163],"Discrete":[147,165],"Algorithms,":[148,166],"1993,":[149],"pp.":[150,168],"322\u2013330]":[151],"Luby,":[153],"Mitzenmacher,":[154],"Shokrollahi":[156],"Ninth":[160],"1998,":[167],"364\u2013373]":[169],"densities":[176],"terminators":[178,211],"exist.":[179],"Thus":[180],"we":[181],"($\\approx$1.63)":[188],"lower":[191],"threshold.":[196],"(We":[197],"conjecture":[198],"in":[204],"fact":[205],"higher.)":[206],"One":[207],"nice":[208],"property":[209],"they":[214],"can":[215],"found":[217],"efficiently":[218,236],"via":[219],"programming.":[221],"makes":[223],"tractable":[224],"future":[226],"investigation":[227],"also":[233],"provides":[234],"an":[235],"computable":[237],"certificate":[238],"short":[240],"simple":[245],"heuristic.":[248]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2016-06-24T00:00:00"}