{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:45:54Z","timestamp":1720640754823},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s1571-0653(04)00315-4","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"81-95","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["The unsatisfiability threshold revisited"],"prefix":"10.1016","volume":"9","author":[{"given":"Alexis C.","family":"Kaporis","sequence":"first","affiliation":[]},{"given":"Lefteris M.","family":"Kirousis","sequence":"additional","affiliation":[]},{"given":"Yannis C.","family":"Stamatiou","sequence":"additional","affiliation":[]},{"given":"Malvina","family":"Vamvakari","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Zito","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00315-4_BIB1","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/SFCS.2000.892327","article-title":"\u201cOptimal Myopic Algorithms for Random 3-SAT\u201d","author":"Achlioptas","year":"2000","journal-title":"Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS)"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB2","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB3","article-title":"Advanced Combinatorics; The Art of Finite and Infinite Expansions","author":"Comte","year":"1974","journal-title":"D. Reidel"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02124750","article-title":"\u201cOn the Lambert W function,\u201d","volume":"5","author":"Corless","year":"1996","journal-title":"Advances in Computational Mathematics"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB5","first-page":"126","article-title":"\u201cTypical random 3-SAT formulae and the satisfiability threshold,\u201d","author":"Dubois","year":"2000","journal-title":"Proc. 11th Symposium on Discrete Algorithms (SODA)"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB6","unstructured":"W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd ed., 1968."},{"key":"10.1016\/S1571-0653(04)00315-4_BIB7","article-title":"Basic Hypergeometric Series and Applications","volume":"Number 27","author":"Fin","year":"1980","journal-title":"Mathematical Surveys and Monographs"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB8","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","article-title":"appendix by J. Bourgain, \u201cSharp thresholds of graph properties, and the k-sat problem,\u201d","volume":"12","author":"Friedgu","year":"1999","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/S1571-0653(04)00315-4_BIB9","article-title":"Basic Hypergeometric Series","volume":"vol 35","author":"Gasper","year":"1990"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB10","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1002\/1098-2418(200009)17:2<103::AID-RSA2>3.0.CO;2-P","article-title":"\u201cBounding the unsatisfiability threshold of random 3-SAT,\u201d","volume":"17","author":"Janson","year":"2000","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/rsa.3240070105","article-title":"\u201cTail bounds for the occupancy and the satisfiability threshold conjecture,\u201d","volume":"7","author":"Kamath","year":"1995","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U","article-title":"\u201cApproximating the unsatisfiability threshold of random formulas,\u201d","volume":"12","author":"Kirousis","year":"1998","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB13","series-title":"An inequality for reducible, increasing properties of randomly generated words, Technical Report TR-96.10.34, Computer Technology Institute","author":"Kirousis","year":"1996"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB14","series-title":"Fundamental Algorithms","author":"Knut","year":"1973"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB15","article-title":"Random Mappings, Translation series in Mathematics and Engineering","author":"Kolchi","year":"1986","journal-title":"Optimization Software Inc."},{"key":"10.1016\/S1571-0653(04)00315-4_BIB16","volume":"5","author":"Monagan","year":"1998"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB17","series-title":"Handbook of Combinatorics, Chapter 22","first-page":"1063","article-title":"\u201cAsymptotic Enumeration Methods,\u201d","author":"Odlyzk","year":"1995"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB18","series-title":"Numerical Recipes in C: The Art of Scientific Computing","author":"Press","year":"1993"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB19","series-title":"Advanced Calculus","author":"Taylor","year":"1983"},{"key":"10.1016\/S1571-0653(04)00315-4_BIB20","unstructured":"F.J. Wrigh: http:\/\/centaur.maths.qmw.ac.uk\/Computer_Algebra\/. A Maple (V-5) implementation of Downhill Simplex based on code given in [18]."},{"key":"10.1016\/S1571-0653(04)00315-4_BIB21","series-title":"Randomised Techniques in Combinatorial Algorithmics, PhD Thesis, Department of Computer Science","author":"Zit","year":"1999"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304003154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T13:50:19Z","timestamp":1548597019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304003154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":21,"alternative-id":["S1571065304003154"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00315-4","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}