{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T01:36:28Z","timestamp":1773538588544,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1182003","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T15:35:00Z","timestamp":1056641700000},"page":"779-788","source":"Crossref","is-referenced-by-count":51,"title":["The asymptotic order of the random k-SAT threshold"],"prefix":"10.1109","author":[{"given":"D.","family":"Achlioptas","sequence":"first","affiliation":[]},{"given":"C.","family":"Moore","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200009)17:2<103::AID-RSA2>3.0.CO;2-P"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0081"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90144-6"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0017-3"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0016"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90017-3"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00305-7"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001590"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00156-6"},{"key":"21","author":"kaporis","year":"2002"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070105"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00315-4"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U"},{"key":"24","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"mitchell","year":"1992","journal-title":"Proc Nat Conf Artif Intell"},{"key":"25","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1103\/PhysRevE.56.1357","article-title":"Statistical mechanics of the random K-satisfiability model","volume":"56","author":"monasson","year":"1997","journal-title":"Phys Rev E (3)"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1145\/7531.8928"},{"key":"3","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/SFCS.2000.892327","article-title":"Optimal myopic algorithms for random 3-SAT","author":"achlioptas","year":"2000","journal-title":"Proceedings Annual Symposium on Foundations of Computer Science"},{"key":"2","first-page":"721","article-title":"The phase transition in 1-in-k SAT and NAE 3-SAT","author":"achlioptas","year":"2001","journal-title":"Proc 12th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"10","first-page":"126","article-title":"Typical random 3-SAT formulae and the satisfiability threshold","author":"dubois","year":"2000","journal-title":"Proc 11th Annual ACM-SIAM Symp Discrete Algorithms"},{"key":"1","first-page":"28","article-title":"Setting two variables at a time yields a new lower bound for random 3-SAT","author":"achlioptas","year":"2000","journal-title":"Proc 29th Ann ACM Symp on Theory of Comp"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267789"},{"key":"6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0255(90)90030-E","article-title":"Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem","volume":"51","author":"chao","year":"1990","journal-title":"Inform Sci"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/0215080"},{"key":"4","first-page":"322","article-title":"On the satisfiability and maximum satisfiability of random 3-CNF formulas","author":"broder","year":"1993","journal-title":"Proc the 4th annual ACM-SIAM Symposium on Discrete algorithms"},{"key":"9","author":"de bruijn","year":"1981","journal-title":"Asymptotic Methods in Analysis"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48016"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","location":"Vancouver, BC, Canada","acronym":"SFCS-02"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01182003.pdf?arnumber=1182003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:46:26Z","timestamp":1497566786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/1182003\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":27,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/sfcs.2002.1182003","relation":{},"subject":[]}}