{"id":"https://openalex.org/W2132240307","doi":"https://doi.org/10.1002/1098-2418(200009)17:2<103::aid-rsa2>3.0.co;2-p","title":"Bounding the unsatisfiability threshold of random 3-SAT","display_name":"Bounding the unsatisfiability threshold of random 3-SAT","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2132240307","doi":"https://doi.org/10.1002/1098-2418(200009)17:2<103::aid-rsa2>3.0.co;2-p","mag":"2132240307"},"language":"en","primary_location":{"id":"doi:10.1002/1098-2418(200009)17:2<103::aid-rsa2>3.0.co;2-p","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1098-2418(200009)17:2<103::aid-rsa2>3.0.co;2-p","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","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/A5022615833","display_name":"Svante Janson","orcid":"https://orcid.org/0000-0002-9680-2790"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Svante Janson","raw_affiliation_strings":["Department of Mathematics, Uppsala University, P.O. Box 480, S-751 06 Uppsala, Sweden","Department of Mathematics, Uppsala University, P.O. Box 480, S-751 06, Uppsala, Sweden#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Uppsala University, P.O. Box 480, S-751 06 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"raw_affiliation_string":"Department of Mathematics, Uppsala University, P.O. Box 480, S-751 06, Uppsala, Sweden#TAB#","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025854118","display_name":"Yannis C. Stamatiou","orcid":"https://orcid.org/0000-0002-8925-9427"},"institutions":[{"id":"https://openalex.org/I120729142","display_name":"Research Academic Computer Technology Institute","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]},{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Yannis C. Stamatiou","raw_affiliation_strings":["Department of Computer Engineering and Informatics, University of Patras, Rio 265 00, Patras, Greece and Computer Technology Institute, Kolokotroni 3, 263 21, Patras, Greece","Research performed while this author was visiting the School of Computer Science of Carleton University in Ottawa"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, Rio 265 00, Patras, Greece and Computer Technology Institute, Kolokotroni 3, 263 21, Patras, Greece","institution_ids":["https://openalex.org/I120729142","https://openalex.org/I174878644"]},{"raw_affiliation_string":"Research performed while this author was visiting the School of Computer Science of Carleton University in Ottawa","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013929795","display_name":"Malvina Vamvakari","orcid":"https://orcid.org/0000-0002-3381-3257"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]},{"id":"https://openalex.org/I120729142","display_name":"Research Academic Computer Technology Institute","ror":"https://ror.org/021nszj63","country_code":"GR","type":"facility","lineage":["https://openalex.org/I120729142","https://openalex.org/I4210154149"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Malvina Vamvakari","raw_affiliation_strings":["Department of Computer Engineering and Informatics, University of Patras, Rio 265 00, Patras, Greece and Computer Technology Institute, Kolokotroni 3, 263 21, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering and Informatics, University of Patras, Rio 265 00, Patras, Greece and Computer Technology Institute, Kolokotroni 3, 263 21, Patras, Greece","institution_ids":["https://openalex.org/I120729142","https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025854118"],"corresponding_institution_ids":["https://openalex.org/I120729142","https://openalex.org/I174878644"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":10.2935,"has_fulltext":false,"cited_by_count":61,"citation_normalized_percentile":{"value":0.98045923,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"17","issue":"2","first_page":"103","last_page":"116"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9959999918937683,"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.9959999918937683,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9760000109672546,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.963100016117096,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.7898368835449219},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4929325580596924},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4611985385417938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42150160670280457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3663311302661896},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13807284832000732}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7898368835449219},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4929325580596924},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4611985385417938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42150160670280457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3663311302661896},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13807284832000732}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/1098-2418(200009)17:2<103::aid-rsa2>3.0.co;2-p","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1098-2418(200009)17:2<103::aid-rsa2>3.0.co;2-p","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.6283","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.6283","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uu.se/%7Esvante/papers/sj127.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W242035403","https://openalex.org/W1491226129","https://openalex.org/W1559492868","https://openalex.org/W1971079746","https://openalex.org/W1980948271","https://openalex.org/W2000931246","https://openalex.org/W2019433297","https://openalex.org/W2051580875","https://openalex.org/W2079813322","https://openalex.org/W2120062331","https://openalex.org/W3016843226","https://openalex.org/W4249087361"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"The":[0,53],"satisfiability":[1],"threshold":[2],"conjecture":[3],"states":[4],"that":[5,23,48,91,134,144,194,232],"for":[6,79,191,244],"a":[7,45,128,145,164,212,229,234],"randomly":[8],"generated":[9],"formula":[10,148],"of":[11,14,163,168,172,199,214,237,247],"m":[12],"clauses":[13],"exactly":[15],"k":[16,51],"literals":[17],"over":[18,130],"n":[19,28,169],"variables,":[20],"the":[21,39,113,141,142,152,160,176,184,197,207,215,219,224],"probability":[22,143],"it":[24,73,87,93,95,104],"is":[25,42,56,61,74,88,149,157],"satisfiable,":[26],"as":[27,38,159],"tends":[29],"to":[30,36,76,116,140],"infinity,":[31],"changes":[32],"abruptly":[33],"from":[34,187,196,203],"1":[35,77],"0,":[37],"ratio":[40,60],"r=m/n":[41],"increased":[43],"past":[44],"specific":[46],"value":[47,70,185,225],"depends":[49],"on":[50],"alone.":[52],"opposite":[54],"behavior":[55],"observed":[57],"if":[58,92],"this":[59,65,69,109,155,192],"slightly":[62],"decreased":[63],"below":[64],"value.":[66],"For":[67,85],"k=2,":[68],"exists":[71],"and":[72,99,240],"equal":[75],"while":[78,101],"k>2":[80],"its":[81],"existence":[82],"remains":[83],"open.":[84],"k=3,":[86],"rigorously":[89],"shown":[90],"exists,":[94],"falls":[96],"between":[97],"3.003":[98],"4.6011":[100],"experiments":[102],"place":[103],"to,":[105],"about,":[106],"4.2.":[107],"In":[108,122,151,206],"paper,":[110],"we":[111,125,210],"lower":[112],"upper":[114,138,242],"bound":[115,139],"4.596":[117,186,226],"through":[118],"two":[119],"different":[120],"approaches.":[121],"both":[123],"approaches,":[124],"start":[126],"with":[127,218],"sum":[129,156,217],"all":[131],"truth":[132],"assignments":[133],"appears":[135],"in":[136],"an":[137,188,200],"random":[146],"3-SAT":[147],"satisfiable.":[150],"first":[153],"approach,":[154,209],"reformulated":[158],"partition":[161],"function":[162,193,236],"spin":[165],"system":[166],"consisting":[167],"sites":[170],"each":[171,245],"which":[173],"may":[174],"assume":[175],"values":[177],"0":[178],"or":[179],"1.":[180],"We":[181,222],"then":[182],"obtain":[183,223],"asymptotic":[189],"expression":[190],"results":[195],"application":[198],"optimization":[201],"technique":[202,231],"statistical":[204],"physics.":[205],"second":[208],"use":[211],"connection":[213],"same":[216],"Rogers\u2013Szeg\u00f6":[220],"polynomials.":[221],"by":[227],"applying":[228],"general":[230],"exploits":[233],"generating":[235],"these":[238],"polynomials":[239],"provides":[241],"bounds":[243],"one":[246],"them.":[248],"\u00a9":[249],"2000":[250,261],"John":[251],"Wiley":[252],"&":[253],"Sons,":[254],"Inc.":[255],"Random":[256],"Struct.":[257],"Alg.,":[258],"17:":[259],"103\u2013116,":[260]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}