The resolution complexity of random constraint satisfaction problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 330-339

  Molloy, M ^a   Salavatipour, M ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Artificial intelligence; Chromium; Computer science; Polynomials

Indexed keywords

ARTIFICIAL INTELLIGENCE; CHROMIUM; COMPUTER SCIENCE; POLYNOMIALS;

CLAUSE DENSITY; DOMAIN SIZE; RANDOM CONSTRAINT SATISFACTION PROBLEMS; RANDOM INSTANCE; RESOLUTION COMPLEXITY; SHARP THRESHOLD; SPECIFIC VALUES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84943373886     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238207     Document Type: Conference Paper

References (32)

1. D. Achlioptas. Lower bounds for random 3-SAT via differential equations. Theoretical Computer Science, 265 (1-2), (2001), p.159-185.
2. D. Achlioptas, P. Beame and M. Molloy. A sharp threshold in proof complexity. Proceedings of STOC 2001, 337-346.
3. D. Achlioptas, A. Chtcherba, G. Istrate and C. Moore. The phase transition in NAESAT and 1-in-k SAT. Proceedings of SODA 01, 721-722.
4. D. Achlioptas, L. Kirousis, E. Kranakis, and D. Krizanc Rigorous results for random (2 + p)-SAT. Proceedings of RALCOM '97 (1997), and Theoretical Computer Science, 265 (1-2), (2001), p.109-129.
5. 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).
6. Conference version in Proceedings of CP 97, 107-120.
7. P. Beame, J. Culberson and D. Mitchell. The resolution complexity of random graph k-colourability. In preparation.
8. P. Beame and T. Pitassi. Simplified and improved resolution lower bounds. Proceedings of FOCS 1996, 274-282.
9. 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).
10. E. Ben-Sasson and A. Wigderson. Short proofs are narrow - resolution made simple. Proceedings of STOC 1999 and Journal of the ACM 48 (2001)
11. V. Chvátal and B. Reed. Mick gets some (the odds are on his side). In Proceedings 33rd Annual Symposium on Foundations of Computer Science, pages 620-627, Pittsburgh, PA, October 1992. IEEE.
12. V. Chvatal and E. Szemeredi. Many hard examples for resolution. Journal of the ACM 35 (1988) 759-768.
13. N. Creignou and H. Daude. Satisfiability threshold for random XOR-CNF formulas. Discrete Applied Mathematics, 96-97, 4153 (1999)
14. N. Creignou and H. Daude. Random generalized satisfiability problems. Proceedings of SAT 2002.
15. N. Creignou, H. Daude and O. Dubois. Approximating the satisfiability threshold of random k-XOR-formulas. Preprint.
16. O. Dubois and J. Mandler. The 3-XORSAT threshold (strong evidence in favour of the replica method of statistical physics). Proceedings of FOCS 2002.
17. M. Dyer, A. Frieze and M. Molloy. A probabilistic analysis of randomly generated binary constraint satisfaction problems.
18. W. Fernandex de la Vega. On random 2-SAT. manuscript (1992).
19. Y. Gao and J. Culberson. Resolution complexity of random constraint satisfaction problems: another half of the story. Proceedings of LICS'03, Workshop on Typical Case Complexity and Phase Transitions.
20. I. Gent, E. MacIntyre, P. Prosser, B. Smith and T. Walsh. Random constraint satisfaction: flaws and structure. Constraints 6, 345-372 (2001).
21. A. Goerdt. A threshold for unsatisfiability. Journal of Computer and System Sciences, 53:469-486, 1996.
22. A. Haken. The intractability of resolution. Theoretical Computer Science 39, 297-305 (1985).
23. S. Janson, T. Łuczak and A. Ruciński. Random Graphs. Wiley, New York (2000).
24. L. Kirousis, E. Kranakis, D. Krizanc and Y. Stamatiou. Approximating the unsatisfiability threshold of random formulas. Random Structures and Algorithms 12 (1998), 253-269.
25. D. Mitchell. Resolution complexity of random constraints. Proceedings of Principles and Practices of Constraint Programming - CP 2002.
26. D. Mitchell The Resolution Complexity of Constraint Satisfaction. Ph.D. Thesis, University of Toronto, 2002.
27. M. Molloy, Models for Random Constraint Satisfaction Problems. Proceedings of STOC 2002, 209-217. Longer version to appear in SIAM J. Computing.
28. R. Monasson and R. Zecchina. Tricritical point in the random 2+p-SAT problem. J. Phys. A 31, 9209 (1998).
29. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky. 2+p-SAT: Relation of typical-case complexity to the nature of the phase transition. Random Structure and Algorithms 15, 414 (1999).
30. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky. Phase transition and search cost in the 2+p-sat problem. Proceedings of PhysComp 96, T. Toffoli, M. Biafore, J. Leao eds., Boston (1996).
31. A. Urquhart. Hard examples for resolution. Journal of the ACM, 34 209-219 (1987).
32. K. Xu and W. Li. Exact Phase transitions in random constraint satisfaction problems. J. Artificial Intelligence Research, 12(2000):93-103.