Many hard examples in exact phase transitions

Theoretical Computer Science

Volumn 355, Issue 3, 2006, Pages 291-302

  Xu, Ke ^a   Li, Wei ^a  

^a BEIHANG UNIVERSITY   (China)

Author keywords

Constraint satisfaction problem (CSP); Phase transitions; Random problems; Resolution complexity; SAT

Indexed keywords

ALGORITHMS; HAMILTONIANS; MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES;

CONSTRAINT SATISFACTION PROBLEM (CSP); RANDOM PROBLEMS; RESOLUTION COMPLEXITY; SAT;

PHASE TRANSITIONS;

EID: 33644931188     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.001     Document Type: Article

References (33)

1. D. Achlioptas, L. Kirousis, E. Kranakis, D. Krizanc, Rigorous results for random (2+p)-SAT, in: Proc. of RALCOM-97, pp. 1-10.
2. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M.S. Molloy, and Y.C. Stamatiou Random constraint satisfaction: a more accurate picture Proc. Third Internat. Conf. on Principles and Practice of Constraint Programming (CP 97), Lecture Notes in Computer Science vol. 1330 1997 Springer Berlin 107 120
3. D. Aldous, and A. Percus Scaling and universality in continuous length combinatorial optimization Proc. Nat. Acad. Sci. USA 100 2003 11211 11215
4. P. Beame, R. Karp, T. Pitassi, M. Saks, On the complexity of unsatisfiability proofs for random k-CNF formulas, in: Proc. of STOC-98, pp. 561-571.
5. P. Beame, R. Karp, T. Pitassi, and M. Saks The efficiency of resolution and Davis-Putnam procedures SIAM J. Comput. 31 4 2002 1048 1075
6. E. Ben-Sasson, and A. Wigderson Short proofs are narrow - resolution made simple J. ACM 48 2 2001 149 169
7. B. Bollobás, T.I. Fenner, and A.M. Frieze An algorithm for finding Hamilton paths and cycles in random graphs Combinatorica 7 4 1987 327 341
8. V. Chvátal, B. Reed, Miks gets some (the odds are on his side), in: Proc. of the 33rd IEEE Symp. on Foundations of Comput. Sci. 1992, pp. 620-627.
9. V. Chvátal, and E. Szemerédi Many hard examples for resolution J. ACM 35 4 1988 208 759
10. H. Connamacher, M. Molloy, The exact satisfiability threshold for a potentially intractable random constraint satisfaction problem, in: Proc. of FOCS 2004.
11. S. Cook, D. Mitchell, Finding hard instances of the satisfiability problem: a survey, in: Du, Gu, Pardalos (Eds.), Satisfiability Problem: Theory and Applications, DIMACS Ser. in Discrete Mathematics and Theoretical Computer Science, vol. 35, 1997.
12. N. Creignou, and H. Daudé Combinatorial sharpness criterion and phase transition classification for random CSPs Inform. Comput. 190 2 2004 220 238
13. O. Dubois, J. Mandler, The 3-XORSAT threshold, in: Proc. FOCS 2002.
14. M. Dyer, A. Frieze, and M. Molloy A probabilistic analysis of randomly generated binary constraint satisfaction problems Theoret. Comput. Sci. 290 2003 1815 1828
15. A. Flaxman, A sharp threshold for a random constraint satisfaction problem, preprint.
16. E. Friedgut Sharp thresholds of graph properties, and the k-sat problem. With an appendix by Jean Bourgain J. Amer. Math. Soc. 12 1999 1017 1054
17. A. Frieze, M. Molloy, The satisfiability threshold for randomly generated binary constraint satisfaction problems, in: Proc. of RANDOM-03, 2003.
18. A.M. Frieze, N.C. Wormald, Random k-SAT: a tight threshold for moderately growing k, in: Proc. of the Fifth Internat. Symp. on Theory and Appl. of Satisfiability Testing, 2002, pp. 1-6.
19. Y. Gao, J. Culberson, Resolution complexity of random constraint satisfaction problems: another half of the story, in: Proc. LICS-03, Workshop on Typical Case Complexity and Phase Transitions, Ottawa, Canada, June 2003.
20. I.P. Gent, E. MacIntyre, P. Prosser, B.M. Smith, and T. Walsh Random constraint satisfaction: flaws and structures J. Constraints 6 4 2001 345 372
21. A. Goerdt, A threshold for unsatisfiability, in: 17th Internat. Symp. of Math. Foundations of Comput. Sci., Lecture Notes in Computer Science, vol. 629, Springer, Berlin, 1992, pp. 264-275.
22. M. Komlós, and E. Szemerédi Limit distribution for the existence of a Hamilton cycle in a random graph Discrete Math. 43 1983 55 63
23. D. Mitchell, Resolution complexity of random constraints, in: Proc. CP 2002, Lecture Notes in Computer Science, vol. 2470, pp. 295-309.
24. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of sat problems, in: Proc. 10th Nat. Conf. on Artificial Intelligence (AAAI-92), 1992, pp. 459-465.
25. M. Molloy, Models for random constraint satisfaction problems, Conference version, in: Proc. of STOC 2002, submitted.
26. M. Molloy, M. Salavatipour, The resolution complexity of random constraint satisfaction problems, in: Proc. FOCS-03, 2003.
27. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky Phase transition and search Cost in the 2 + p -SAT problem Fourth Workshop on Phys. and Comput. 22-24 November 1996 Boston University (PhysComp96)
28. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky Determining computational complexity from characteristic phase transitions Nature 400 8 1999 133 137
29. B.M. Smith Constructing an asymptotic phase transition in random binary constraint satisfaction problems Theoret. Comput. Sci. 265 2001 265 283 (Special Issue on NP-Hardness and Phase Transitions)
30. B. Vandegriend, and J. Culberson The G n, m phase transition is not hard for the Hamiltonian cycle problem J. Artif. Intell. Res. 9 1998 219 245
31. K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre A simple model to generate hard satisfiable instances Proc. 19th Internat. Joint Conf. on Artificial Intelligence (IJCAI) 2005 Edinburgh Scotland 337 342
32. K. Xu, and W. Li Exact phase transitions in random constraint satisfaction problems J. Artif. Intell. Res. 12 2000 93 103
33. K. Xu, and W. Li On the average similarity degree between solutions of random k-SAT and random CSPs Discrete Appl. Math. 136 2004 125 149