{"id":"https://openalex.org/W2108446739","doi":"https://doi.org/10.1109/sfcs.2002.1182003","title":"The asymptotic order of the random k-SAT threshold","display_name":"The asymptotic order of the random k-SAT threshold","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2108446739","doi":"https://doi.org/10.1109/sfcs.2002.1182003","mag":"2108446739"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1182003","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1182003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5021300666","display_name":"Dimitris Achlioptas","orcid":"https://orcid.org/0000-0003-2349-822X"},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Achlioptas","raw_affiliation_strings":["Microsoft Corp., Redmond, WA, USA","Microsoft Corporation Redmond,WA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Corp., Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Corporation Redmond,WA,USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008033989","display_name":"Cristopher Moore","orcid":"https://orcid.org/0000-0002-2062-1942"},"institutions":[{"id":"https://openalex.org/I1308548392","display_name":"Santa Fe Institute","ror":"https://ror.org/01arysc35","country_code":"US","type":"funder","lineage":["https://openalex.org/I1308548392"]},{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Moore","raw_affiliation_strings":["University of New Mexico, and Santa Fe Institute#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico, and Santa Fe Institute#TAB#","institution_ids":["https://openalex.org/I1308548392","https://openalex.org/I169521973"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"779","last_page":"788"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983999729156494,"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.9983999729156494,"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/T11182","display_name":"Auction Theory and Applications","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.968999981880188,"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/combinatorics","display_name":"Combinatorics","score":0.7345435619354248},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6381480693817139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.628057062625885},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.6002752780914307},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5068214535713196},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.5046113729476929},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.4664005637168884},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45086416602134705},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41488680243492126},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15495029091835022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07807579636573792},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06891268491744995}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7345435619354248},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6381480693817139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.628057062625885},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.6002752780914307},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5068214535713196},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.5046113729476929},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4664005637168884},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45086416602134705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41488680243492126},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15495029091835022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07807579636573792},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06891268491744995},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sfcs.2002.1182003","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1182003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.11.9230","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.9230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/~optas/papers/order.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.305.9359","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.9359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cond-mat/0209622v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4099999964237213}],"awards":[],"funders":[{"id":"https://openalex.org/F4320323641","display_name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","ror":"https://ror.org/044gwpv05"},{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"},{"id":"https://openalex.org/F4320338304","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W4983232","https://openalex.org/W242035403","https://openalex.org/W1512190194","https://openalex.org/W1559492868","https://openalex.org/W1772716870","https://openalex.org/W1963913579","https://openalex.org/W1969966778","https://openalex.org/W1985250014","https://openalex.org/W2000931246","https://openalex.org/W2001508095","https://openalex.org/W2018251959","https://openalex.org/W2022695609","https://openalex.org/W2025593265","https://openalex.org/W2051580875","https://openalex.org/W2054387247","https://openalex.org/W2069767473","https://openalex.org/W2098022011","https://openalex.org/W2113680569","https://openalex.org/W2126420408","https://openalex.org/W2128782263","https://openalex.org/W2131459042","https://openalex.org/W2132240307","https://openalex.org/W2138778293","https://openalex.org/W2151140339","https://openalex.org/W2164346692","https://openalex.org/W2167266655","https://openalex.org/W2175929500","https://openalex.org/W2242479605","https://openalex.org/W2295428206","https://openalex.org/W3143264742","https://openalex.org/W4231916799","https://openalex.org/W6600203084","https://openalex.org/W6609265319","https://openalex.org/W6641350426","https://openalex.org/W6650880466"],"related_works":["https://openalex.org/W2306553012","https://openalex.org/W4251417359","https://openalex.org/W4229993731","https://openalex.org/W2381059884","https://openalex.org/W2372756075","https://openalex.org/W1979193983","https://openalex.org/W2220405813","https://openalex.org/W1821795854","https://openalex.org/W2374111230","https://openalex.org/W4288366895"],"abstract_inverted_index":{"Form":[0],"a":[1,36,93],"random":[2],"k-SAT":[3],"formula":[4,51],"on":[5],"n":[6,43],"variables":[7],"by":[8],"selecting":[9],"uniformly":[10],"and":[11,60],"independently":[12],"m=rn":[13],"clauses":[14],"out":[15],"of":[16,96,99,102],"all":[17],"2/sup":[18,72],"k/":[19,39,59],"(/sub":[20],"k//sup":[21],"n/)":[22],"possible":[23],"k-clauses.":[24],"The":[25],"satisfiability":[26],"threshold":[27],"conjecture":[28],"asserts":[29],"that":[30,49,71,78],"for":[31],"each":[32],"k":[33],"there":[34],"exists":[35],"constant":[37],"r/sub":[38,79],"such":[40],"that,":[41],"as":[42],"tends":[44,54],"to":[45,55,61],"infinity,":[46],"the":[47,50,97,100],"probability":[48],"is":[52],"satisfiable":[53],"1":[56],"if":[57,63],"r<r/sub":[58],"0":[62],"r>r/sub":[64],"k/.":[65,75],"It":[66],"has":[67],"long":[68],"been":[69],"known":[70],"k//k<r/sub":[73],"k/<2/sup":[74],"We":[76],"prove":[77],"k/>2/sup":[80],"k-1/":[81],"ln":[82],"2-d/sub":[83],"k/,":[84],"where":[85],"d/sub":[86],"k//spl":[87],"rarr/(1+ln2)/2.":[88],"Our":[89],"proof":[90],"also":[91],"allows":[92],"blurry":[94],"glimpse":[95],"\"geometry\"":[98],"set":[101],"satisfying":[103],"truth":[104],"assignments.":[105]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}