The exact satisfiability threshold for a potentially intractable random constraint satisfaction problem

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

Volumn , Issue , 2004, Pages 590-599

  Connamacher, Harold ^a   Molloy, Michael ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEM; RANDOM INSTANCES; THRESHOLD CHARACTERISTICS;

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES; THEOREM PROVING;

PROBLEM SOLVING;

EID: 17744372925     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (50)

1. D. Achlioptas. Lower bounds for random 3-SAT via differential equations. Theoretical Computer Science, 265(1-2):159-185, August 2001.
2. D. Achlioptas, P. Beame, and M. Molloy. A sharp threshold in proof complexity yields lower bounds for satisfiability search. Journal of Computer and System Sciences, 68(2):238-268, March 2004.
3. D. Achlioptas, A. Chtcherba, G. Istrate, and C. Moore. The phase transition in 1-in-k SAT and NAE 3-SAT. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 721-722, 2001.
4. D. Achlioptas, L. M. Kirousis, E. Kranakis, and D. Krizanc. Rigorous results for random (2 + p)-SAT. Theoretical Computer Science, 265(1-2): 109-129, August 2001.
5. D. Achlioptas, M. S. O. Molloy, L. M. Kirousis, Y. C. Stanatiou, E. Kranakis, and D. Krizanc. Random constraint satisfaction: A more accurate picture. Constraints, 6(4):329-344, October 2001.
6. D. Achlioptas and C. Moore. The asymptotic order of the random k-SAT threshold. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 779-788, 2002.
7. T. M. Apostol. Mathematical Analysis: A Modern Approach to Advanced Calculus. Addison-Wesley, 1957 and 1974.
8. C. Bender and S. Orsag. Advanced Mathematical Methods for Scientists and Engineers. McGraw-Hill, 1978.
9. A. Braunstein, M. Mezard, M. Weigt, and R. Zecchina. Constraint satisfaction by survey propagation. arxiv.org/abs/cond-mat/0212451, 2003.
10. P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the REALLY hard problems are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 331-337, 1991.
11. V. Chvátal and B. Reed. Mick gets some (the odds are on his side). In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 620-627, 1992.
12. V. Chvátal and E. Szemerédi. Many hard examples for resolution. Journal of the ACM, 35(4):759-768, October 1988.
13. S. Cocco, R. Monasson, A. Montanari, and G. Semerjian. Approximate analysis of search algorithms with "physical" methods. arxiv.org/abs/cs.CC/0302003, 2003.
14. H. Connamacher. A random constraint satisfaction problem that seems hard for DPLL. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, pages 3-11, 2004.
15. N. Creignou and H. Daudé. Crossed classification, complexity versus phase transition, for boolean CSPs. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing, 2003.
16. N. Creignou and H. Daudé. Generalized satisfiability problems: Minimal elements and phase transisitons. Theoretical Computer Science, 302(1-3):417-430, June 2003.
17. N. G. de Bruijn. Asymptotic Methods in Analysis. North-Holland, 1958 and 1970. Dover reprint, 1981.
18. O. Dubois, Y. Boufkhad, and J. Mandler. Typical random 3-SAT formulae and the satisfiability threshold. Technical Report TR03-007, Electronic Colloquium on Computational Complexity, 2003.
19. O. Dubois and J. Mandler. The 3-XORSAT threshold. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 769-778, 2002.
20. M. Dyer, A. Frieze, and M. Molloy. A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theoretical Computer Science, 290(3): 1815-1828, January 2003.
21. W. Femandez de la Vega. On random 2-SAT. Manuscript, 1992.
22. A. D. Flaxman. A sharp threshold for a random constraint satisfaction problem. Discrete Mathematics, 285(1-3):301-305, August 2003.
23. E. Friedgut. Sharp thresholds of graph properties and the k-SAT problem. Journal of the American Mathematical Society, 12(4): 1017-1054, 1999.
24. A. Frieze and N. C. Wormald. Random k-SAT: A tight threshold for moderately growing k. In Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing, pages 1-6, 2002.
25. A. M. Frieze and M. Molloy. The satisfiability threshold for randomly generated binary constraint satisfaction problems. In Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, 2003.
26. Y. Gao and J. Culberson. Resolution complexity of random constraint satisfaction problems: Another half of the story. Electronic Notes in Discrete Mathematics, 16, 2003.
27. I. P. Gent, E. Maclntyre, P. Presser, B. M. Smith, and T. Walsh. Random constraint satisfaction: Flaws and structure. Constraints, 6(4):345-372, October 2001.
28. A. Goerdt. A threshold for unsatisfiability. Journal of Computer and System Sciences, 53(3):469-486, December 1996.
29. M. T. Hajiaghayi and G. B. Sorkin. The satisfiability threshold of random 3-SAT is at least 3.52. arxiv.org/abs/math.CO/0310193.2003.
30. F. Hennecart. Stirling distributions and stirling numbers of the second kind, computational problems and statistics. Kybernetika, 30(3):279-288, 1994.
31. A. C. Kaporis, L. M. Kirousis, and E. Lalas. Selecting complementary pairs of literals. Electronic Notes in Discrete Mathematics, 16, 2003.
32. B. S. Majewski, N. C. Wormald, G. Havas, and Z. J. Czech. A family of perfect hashing methods. The Computer Journal, 39(6):547-554, 1996.
33. O. C. Martin, R. Monasson, and R. Zecchina. Statistical mechanics methods and phase transitions in optimization problems. Theoretical Computer Science, 265(1-2): 3-67, August 2001.
34. M. Mezard, G. Parisi, and M. A. Virasoro. Spin Glass Theory and Beyond, volume 9 of World Scientific Lecture Notes in Physics. World Scientific, 1987.
35. M. Mezard, G. Parisi, and R. Zecchina. Analytic and algorithmic solution of random satisfiability problems. Science, 297:812-815, August 2002.
36. M. Mézard, F. Ricci-Tersenghi, and R. Zecchina. Two solutions to diluted p-spin models and XORSAT problems. Journal of Statistical Physics, 111(3-4):505-533, May 2003.
37. D. G. Mitchell. Resolution complexity of random constraints. In Principles and Practices of Constraint Programming - CP 2002, pages 295-309, 2002.
38. D. G. Mitchell, B. Selman, and H. I. Levesque. Hard and easy distributions of SAT problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 459-465, 1992.
39. M. Molloy. Models and threshold for random constraint satisfaction problems. To appear in SIAM Journal of Computing. Extended abstract in STOC 2002, 209-217.
40. M. Molloy. When does the giant component bring unsatisfiability? Submitted.
41. M. Molloy. The pure literal rule threshold and cores in random hypergraphs. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004.
42. M. Molloy and M. Salavatipour. The resolution complexity of random constraint satisfaction problems. Preprint. Extended abstract in the Proceedings of FOCS 2003, 330-339, 2003.
43. R. Monasson and R. Zecchina. Identical points in random combinatorics: the (2 + p)-SAT case. Journal of Physics A: Mathematical and General, 31(42,20):9209-9217, November 1998.
44. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Phase transitions and search cost in the 2 + p-SAT problem. In 4th Workshop on Physics and Computation, 1996.
45. 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 Structures and Algorithms, 15(3-4):414-435, October-December 1999.
46. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic 'phase transitions'. Nature, 400:133-137, July 1999.
47. T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pages 216-226, 1978.
48. B. M. Smith. Constructing an asymptotic phase transition in random binary constraint satisfaction problems. Theoretical Computer Science, 265(1-2):265-283, August 2001.
49. K. Xu and W. Li. Exact phase transitions in random constraint satisfaction problems. Journal of Artificial Intelligence Research, 12:93-103, 2000.
50. K. Xu and W. Li. Many hard examples in exact phase transitions with application to generating hard satisfiable instances. Technical Report cs.CC/0302001, Computing Research Repository (CoRR), 2003.