{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:26Z","timestamp":1725487646894},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426721"},{"type":"electronic","value":"9783540454465"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45446-2_21","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T22:11:27Z","timestamp":1185142287000},"page":"328-338","source":"Crossref","is-referenced-by-count":2,"title":["Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2001,10,16]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"D. Achlioptas, G. B. Sorkin, \u201cOptimal Myopic Algorithms for Random 3-SAT\u201d in: Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), 2000. pp 590\u2013600.","DOI":"10.1109\/SFCS.2000.892327"},{"key":"21_CR2","unstructured":"N. Alon, J. H. Spencer, P. Erd\u0151s, The Probabilistic Method, John Wiley and Sons, 1992."},{"key":"21_CR3","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s, Random Graphs, Academic Press, London, 1985."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/rsa.3240020103","volume":"2","author":"V. Chv\u00e1tal","year":"1991","unstructured":"V. Chv\u00e1tal, \u201cAlmost all graphs with 1.44n edges are 3-colourable,\u201d Random Structures and Algorithms 2, pp 11\u201328, 1991.","journal-title":"Random Structures and Algorithms"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"L. Comtet, Advanced Combinatorics; The Art of Finite and Infinite Expansions. D. Reidel, 1974.","DOI":"10.1007\/978-94-010-2196-8"},{"key":"21_CR6","unstructured":"R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, D. E. Knuth, \u201cOn the Lambert W function,\u201d manuscript, Computer Science Department, University of Waterloo."},{"key":"21_CR7","unstructured":"O. Dubois, Y. Boufkhad, J. Mandler, \u201cTypical random 3-SAT formulae and the satis.ability threshold,\u201d in: Proc. 11th Symposium on Discrete Algorithms (SODA), pp 126\u2013127, 2000."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01651330","volume":"22","author":"C. M. Fortuin","year":"1971","unstructured":"C. M. Fortuin, R. W. Kasteleyn, J. Ginibre, Correlation inequalities on some partially ordered sets, Commun. Math. Physics 22, pp. 89\u2013103, 1971.","journal-title":"Commun. Math. Physics"},{"key":"21_CR9","unstructured":"N. J. Fine, Basic Hypergeometric Series and Applications, Mathematical Surveys and Monographs, Number 27, 1980."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E. Friedgut","year":"1999","unstructured":"E. Friedgut, appendix by J. Bourgain, \u201cSharp thresholds of graph properties, and the k-sat problem,\u201d J. Amer. Math. Soc. 12, pp 1017\u20131054, 1999.","journal-title":"J. Amer. Math. Soc."},{"key":"21_CR11","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Basic Hypergeometric Series","author":"G. Gasper","year":"1990","unstructured":"G. Gasper, M. Rahman, Basic Hypergeometric Series, Encyclopedia of Mathematics and its Applications, vol 35, Cambridge University Press, Cambridge, 1990."},{"key":"21_CR12","first-page":"108","volume":"17","author":"S. Janson","year":"2000","unstructured":"S. Janson, Y. C. Stamatiou, M. Vamvakari, \u201cBounding the unsatis.ability threshold of random 3-SAT,\u201d Random Structures and Algorithms, 17, pp 108\u2013116, 2000.","journal-title":"Random Structures and Algorithms"},{"key":"21_CR13","volume-title":"Tech. Rep. TR-96.10.34","author":"L.M. Kirousis","year":"1996","unstructured":"L.M. Kirousis, Y. C. Stamatiou, An inequality for reducible, increasing properties of randomly generated words, Tech. Rep. TR-96.10.34, C. T. I., University of Patras, Greece, 1996."},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U","volume":"12","author":"L. M. Kirousis","year":"1998","unstructured":"L. M. Kirousis, E. Kranakis, D. Krizanc, Y. C. Stamatiou, \u201cApproximating the unsatis.ability threshold of random formulas,\u201d Random Structures and Algorithms 12, pp 253\u2013269, 1998.","journal-title":"Random Structures and Algorithms"},{"key":"21_CR15","unstructured":"D. E. Knuth, Fundamental Algorithms, The Art of Computer Programming, 2nd ed., 1973."},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"M. B. Monagan, K. O. Geddes, K. M. Heal, G. Labahn, S. M. Vorkoetter, Programming Guide, Maple V Release 5, Springer-Verlag, 1998.","DOI":"10.1007\/978-1-4612-2216-3"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"21_CR18","unstructured":"A. M. Odlyzko, \u201cAsymptotic Enumeration Methods,\u201d in: R. L. Graham, M. Gr\u00f6tschel, and L. Lov\u00e1sz, eds. Handbook of Combinatorics, Chapter 22, 1063\u20131229, Elsevier, 1995."},{"key":"21_CR19","unstructured":"W. H. Press, S. A. Teukolsky, W. T. Vetterling, B. P. Flannery, Numerical Recipes in C: The Art of Scientific Computing, 2nd ed., Cambridge University Press, 1993."},{"key":"21_CR20","unstructured":"A. E. Taylor, W.R Mann, Advanced Calculus, 3rd ed., John Wiley & Sons, 1983."},{"key":"21_CR21","unstructured":"F. J. Wright: http:\/\/centaur.maths.qmw.ac.uk\/Computer Algebra\/ . A Maple (V-5) implementation of Downhill Simplex based on code given in [19]."},{"key":"21_CR22","unstructured":"M. Zito, Randomised Techniques in Combinatorial Algorithmics, PhD Thesis, Department of Computer Science, University of Warwick, November 1999."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45446-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T07:42:34Z","timestamp":1556696554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45446-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426721","9783540454465"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45446-2_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}