Bounding the unsatisfiability threshold of random 3-SAT

Random Structures and Algorithms

Volumn 17, Issue 2, 2000, Pages 103-116

  Janson, Svante ^a   Stamatiou, Yannis C ^b   Vamvakari, Malvina ^b,c  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF PATRAS   (Greece)

^c University of Patras and Computer Technology Institute   (Greece)

Author keywords

Entropy; Gaussian coefficients; Generating functions; Polynomials; Rogers Szeg ; Spin system; Statistical physics; Unsatisfiability threshold

Indexed keywords

EID: 0034403217     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200009)17:2<103::AID-RSA2>3.0.CO;2-P     Document Type: Article

References (11)

1. M. Abramowitz and I.E. Stegun, Eds., Handbook of mathematical functions, U.S. Department of Commerce, National Bureau of Standards, Washington, DC, 1972.
2. L. Carlitz, Some polynomials related to theta functions, Ann Mat Pure Appl 41 (1956), 359-373.
3. E. Friedgut, Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-sat problem, J Am Math Soc, 12 (1999), 1017-1054.
4. A. Frieze and S. Suen, Analysis of two simple heuristics on a random instance of k-SAT, J Algorithms 20 (1996), 312-355.
5. S. Janson, New versions of Suen's correlation inequality, Random Struct Algorithms 13 (1998), 467-483.
6. L. Kirousis, E. Kranakis, and D. Krizanc, An upper bound for a basic hypergeometric series, Technical Report TR-96-07, Carleton University, Canada, 1996.
7. L.M. Kirousis, E. Kranakis, D. Krizanc, and Y.C. Stamatiou, Approximating the unsatisfiability threshold of random formulas, Random Struct Algorithms 12 (1998), 253-269.
8. D.E. Knuth, Fundamental algorithms, the art of computer programming, 3rd ed., Addison-Wesley, Reading, MA, 1997, Vol. 1.
9. A.M. Odlyzko, "Handbook of combinatorics," Asymptotic enumeration methods, R.L. Graham, M. Grötschel, and L. Lovász (Editors), Elsevier Science, Amsterdam, 1995, pp. 1063-1229, Chap. 22.
10. D. Redfern, The maple handbook: Maple V release 3, Springer-Verlag, New York, 1994.
11. V.N. Sachkov, "Combinatorial methods in discrete mathematics," Encyclopedia of mathematics and its applications, G.-C. Rota (Editor), Cambridge University Press, Cambridge, United Kingdom, 1996, Vol. 55.