The satisfiability threshold for randomly generated binary constraint satisfaction problems

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

Volumn 2764, Issue , 2003, Pages 275-289

  Frieze, Alan ^a   Molloy, Michael ^b,c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; FORMAL LOGIC; OPTIMIZATION;

BINARY CONSTRAINT SATISFACTION; DOMAIN SIZE; LOWER BOUNDS; NATURAL MODELS; NON-TRIVIAL; RESOLUTION COMPLEXITY; SATISFIABILITY; SATISFIABILITY THRESHOLD;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248894361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_24     Document Type: Article

References (28)

1. D. Achlioptas, P. Beame and M. Molloy. A sharp threshold in proof complexity. Proceedings of STOC 2001, 337-346.
2. D. Achlioptas, L. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, and Y. Stamatiou. Random constraint satisfaction: a more accurate picture. Constraints 6, 329-324 (2001).
3. Conference version in Proceedings of CP 97, 107-120.
4. P. Beame, J. Culberson and D. Mitchell. The resolution complexity of random graph k-colourability. In preparation.
5. P. Beame and T. Pitassi. Simplified and improved resolution lower bounds. Proceedings of FOCS 1996, 274-282.
6. P. Beame, R. Karp, T. Pitassi and M. Saks. The efficiency of resolution and Davis-Putnam procedures. Proceedings of STOC 1998 and SIAM Journal on Computing, 31, 1048-1075 (2002).
7. E. Ben-Sasson and A. Wigderson. Short proofs are narrow-resolution made simple. Proceedings of STOC 1999 and Journal of the ACM 48 (2001)
8. B. Bollobas, Random graphs, Second Edition, Cabridge University Press, 2001.
9. B. Bollobas, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European Journal on Combinatorics 1 (1980) 311-316.
10. E. A. Bender and E. R. Canfield, The asymptotic number of labelled graphs with given degree sequence, Journal of Combinatorial Theory (A) 24 (1978) 296-307.
11. V. Chvatal and E. Szemeredi. Many hard examples for resolution. Journal of the ACM 35 (1988) 759-768.
12. N. Creignou and H. Daude. Random generalized satisfiability problems. Proceedings of SAT 2002.
13. R. Dechter, Constraint networks, in Encyclopedia of Artificial Intelligence, S. Shapiro (ed.), Wiley, New York, 2nd ed. (1992) 276-285.
14. M. Dyer, A. Frieze and M. Molloy, A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theoretical Computer Scince 290, 1815-1828 (2003).
15. E. C. Freuder, A sufficient condition for backtrack-free search, Journal of the ACM 29 (1982) 24-32.
16. D. G. Bobrow and M. Brady, eds., Special Volume on Frontiers in Problem Solving: Phase Transitions and Complexity, Guest Editors: T. Hogg, B. A. Hubermann, and C. P. Williams, Artificial Intelligence 81 (1996), nos. 1 and 2.
17. I. Gent, E. MacIntyre, P. Prosser, B. Smith and T. Walsh. Random constraint satisfaction: flaws and structure. Constraints 6, 345-372 (2001).
18. S. Janson, T. Łuczak and A. Ruciński, Random Graphs, Wiley, 2000.
19. A. K. Mackworth, Constraint satisfaction, in Encyclopedia of Artificial Intelligence, S. Shapiro (ed.), Wiley, New York, 2nd ed. (1992) 285-293.
20. D. Mitchell, The Resolution complexity of random constraints. Proceedings of Principles and Practices of Constraint Programming - CP 2002.
21. D. Mitchell, The Resolution Complexity of Constraint Satisfaction. Ph.D. Thesis, University of Toronto, 2002.
22. M. Molloy, Models for Random Constraint Satisfaction Problems. Proceedings of STOC 2002, 209-217.
23. Longer version to appear in SIAM J. Computing.
24. M. Molloy, When does the giant component bring unsatisfiability? Submitted.
25. M. Molloy and M. Salavatipour, The resolution complexity of random constraint satisfaction problems. Submitted.
26. B. Pittel, J. Spencer and N. Worrnald, Sudden emergence of a giant k-core in a random graph, Journal of Combinatorial Theory (B) 67 (1996) 111-151.
27. M. Talagrand, Concentration of mesure and isoperimetric inequalities, Inst. Hautes Études Sci. Publ. Math. 81 (1995) 73-205.
28. D. Waltz, Understanding line drawings of scenes with shadows, The Psychology of Computer Vision, McGraw-Hill, New York, (1975) 19-91.