Approximating the unsatisfiability threshold of random formulas: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 27-38

  Kirousis, Lefteris M ^a   Kranakis, Evangelos ^b   Krizanc, Danny ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOOLEAN FORMULAE; EXPECTED VALUES; EXPERIMENTAL EVIDENCE; EXTENDED ABSTRACTS; RANDOM FORMULAS; REAL NUMBER; UPPER BOUND;

BOOLEAN ALGEBRA;

EID: 84958038313     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_44     Document Type: Conference Paper

References (15)

1. M. Abramowitz and I. E. Stegun (eds.), Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables, 10th printing, U.S. Department of Commerce, National Bureau of Standards, Washington, 1972.
2. D. Achlioptas, L. M. Kirousis, E. Kranakis, D. Krizanc, M. S.O. Molloy, A Correlation Inequality and Its Application to a Word Problem, Technical Report 96-11, School of Computer Science, Carleton University.
3. D.J. Aldous, “The harmonic mean formula for probabilities of unions: applications to sparse random graphs,” Discrete Mathematics 76, pp 167-176, 1989.
4. V. Chvátal and B. Reed, “Mick gets some (the odds are on his side),” Proc. 33rd IEEE Symposium on Foundations of Computer Science, pp 620-627, 1992.
5. V. Chvátal and E. Szemerédi, “Many hard examples for resolution,” Journal of the Association for Computing Machinery 35, pp 759-768, 1988.
6. J. Franco and M. Paull, “Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem,” Discrete Applied Mathematics 5, pp 77-87, 1983.
7. G. Gasper and M. Rahman, Basic Hypergeometric Series, Encyclopedia of Mathematics and its Applications, vol 35, Cambridge University Press, Cambridge, 1990.
8. S. Janson, “Poisson approximation for large deviations,” Random Structures and Algorithms 1, pp 221-230, 1990.
9. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, “Tail bounds for occupancy and the satisfiability threshold conjecture,” Random Structures and Algorithms 7, pp 59-80, 1995. Also in: Proc. 35th FOCS, IEEE, pp 592-603, 1994
10. L. Kirousis, E. Kranakis, and D. Krizanc, An Upper Bound for a Basic Hypergeometric Series, Caxleton University, School of Computer Science, Technical Report TR-96-07, 1996.
11. S. Kirkpatrick and B. Selman, “Critical behavior in the satisfiability of random Boolean expressions,” Science 264, pp 1297-1301, 1994.
12. D. Knuth, Fundamental Algorithms, The Art of Computer Programming, vol. 1, 2nd edition, Addison-Wesley, Reading, Massachusetts, 1973.
13. D. Redfern, The Maple Handbook: Maple V Release 3, Springer-Verlag, New York, 1994.
14. J.-C. Simon, J. Curlier, O. Dubois, and O. Moulines, “Étude statistique de 1’ existence de solutions de problèmes SAT, application aux systèmes-experts,” C.R. Acad. Sci. Paris. Sdr. I Math. 302, pp 283-286, 1986.
15. J. It. Spencer, Ten Lectures on the Probabilistic Method, 2nd edition, SIAM, Philadelphia, 1994