{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T22:56:38Z","timestamp":1730328998085,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,9]]},"DOI":"10.1145\/780542.780577","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"page":"223-231","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["The threshold for random k-SAT is 2\n k<\/sup>\n (ln 2 - O(k))"],"prefix":"10.1145","author":[{"given":"Dimitris","family":"Achlioptas","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Yuval","family":"Peres","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA"}]}],"member":"320","published-online":{"date-parts":[[2003,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652196"},{"key":"e_1_3_2_1_2_1","unstructured":"D. Achlioptas and Y. Peres. The Threshold for Random k-SAT is 2^k ln 2 - O(k). Long version. Available at http:\/\/research.microsoft.com\/~optas\/]] D. Achlioptas and Y. Peres. The Threshold for Random k-SAT is 2^k ln 2 - O(k). Long version. Available at http:\/\/research.microsoft.com\/~optas\/]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646483.691738"},{"volume-title":"Preprint","year":"2002","author":"Braunstein A.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(90)90030-E"},{"key":"e_1_3_2_1_6_1","first-page":"331","volume-title":"Proc. 12th International Joint Conference on Artificial Intelligence (IJCAI-91)","volume":"1","author":"Cheeseman P.","year":"1991"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267789"},{"key":"e_1_3_2_1_8_1","unstructured":"N. G. de Bruijn. Asymptotic methods in analysis. Dover Publications Inc. New York 3rd edition 1981.]] N. G. de Bruijn. Asymptotic methods in analysis. Dover Publications Inc. New York 3rd edition 1981.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02401841"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02020631"},{"key":"e_1_3_2_1_11_1","first-page":"126","volume-title":"Proc. 11th Annual Symposium on Discrete Algorithms","author":"Dubois O.","year":"2000"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90017-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00305-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0016"},{"key":"e_1_3_2_1_15_1","first-page":"1","volume-title":"Proc. 5th International Symposium on Theory and Applications of Satisfiability Testing","author":"Frieze A.","year":"2002"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006314320276"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.757248"},{"key":"e_1_3_2_1_18_1","first-page":"374","volume-title":"Proc. 5th International Conference on Principles of Knowledge Representation and Reasoning","author":"Kautz H.","year":"1996"},{"key":"e_1_3_2_1_19_1","first-page":"1194","volume-title":"Proc. 13th National Conference on Artificial Intelligence","author":"Kautz H.","year":"1996"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199805)12:3%3C253::AID-RSA3%3E3.0.CO;2-U"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.056126"},{"key":"e_1_3_2_1_22_1","first-page":"812","volume":"297","author":"M\u00e9zard M.","year":"2002","journal-title":"Analytic and Algorithmic Solution of Random Satisfiability Problems. Science"},{"key":"e_1_3_2_1_23_1","first-page":"459","volume-title":"Proc. 10th National Conference on Artificial Intelligence","author":"Mitchell D. G.","year":"1992"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.56.1357"},{"key":"e_1_3_2_1_25_1","first-page":"290","volume-title":"Proc. 13th International Joint Conference on Artificial Intelligence","author":"Selman B.","year":"1993"},{"key":"e_1_3_2_1_26_1","first-page":"440","volume-title":"Proc. 10th National Conference on Artificial Intelligence","author":"Selman B.","year":"1992"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1038\/35099646"}],"event":{"name":"STOC03: The 35th Annual ACM Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego CA USA","acronym":"STOC03"},"container-title":["Proceedings of the thirty-fifth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/780542.780577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T05:33:56Z","timestamp":1672983236000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/780542.780577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6,9]]},"references-count":27,"alternative-id":["10.1145\/780542.780577","10.1145\/780542"],"URL":"https:\/\/doi.org\/10.1145\/780542.780577","relation":{},"subject":[],"published":{"date-parts":[[2003,6,9]]},"assertion":[{"value":"2003-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}