Exact Phase Transitions in Random Constraint Satisfaction Problems

Journal of Artificial Intelligence Research

Volumn 12, Issue , 2000, Pages 93-

  Xu, Ke ^a   Li, Wei ^a  

^a BEIHANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14344276587     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.696     Document Type: Article

References (21)

1. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., & Stamatiou, Y. (1999). Random constraint satisfaction: A more accurate picture. Constraints. submitted. Also in Proc. Third International Conference on Principles and Practice of Constraint Programming (CP 97), Springer-Verlag, pp. 107-120, 1997.
2. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., & Stamatiou, Y. (1999). Random constraint satisfaction: A more accurate picture. Constraints. submitted. Also in Proc. Third International Conference on Principles and Practice of Constraint Programming (CP 97), Springer-Verlag, pp. 107-120, 1997.
3. Bollobás, B. (1985). Random Graphs. Academic Press, New York.
4. Cheeseman, P., Kanefsky, B., & Taylor, W. (1991). Where the really hard problems are. In Proceedings of IJCAI-91, pp. 331-337.
5. Dechter, R. (1998). Constraint satisfaction. In MIT Encyclopedia of the Cognitive Sciences (MITECS). Online at "ftp://ftp.ics.uci.edu/pub/CSP-repository/papers/R68.ps".
6. Friedgut, E. (1999). Sharp thresholds for graph properties and the k-sat problem. Journal of the American Mathematical Society, 12, 1017-1054.
7. Frieze, A., & Suen, S. (1996). Analysis of two simlpe heuristics on a random instance of k-sat. Journal of Algorithms, 53, 469-486.
8. Frost, D., & Dechter, R. (1994). In search of the best constraint satisfaction search. In Proceedings of AAAI-94, pp. 301-306.
9. Gent, I., MacIntyre, E., Prosser, P., Smith, B., & Walsh, T. (1999). Random constraint satisfaction: Flaws and structure. Constraints. submitted. Online at " http://www.cs.strath.edu.uk/~apes/apesreports.html".
10. Hogg, T. (1996). Refining the phase transition in combinatorial search. Artificial Intelligence, 81, 127-154.
11. Kirkpatrick, S., & Selman, B. (1994). Critical behavior in the satisfiability of random boolean expressions. Science, 264, 1297-1301.
12. Kirousis, L., Kranakis, E., Krizanc, D., & Stamatiou, Y. (1998). Approximating the unsatisfiability threshold of random formulas. Random Structures and Algorithms, 12, 253-269.
13. Larrosa, J., & Meseguer, P. (1996). Phase transition in max-csp. In Proceedings of ECAI-96, pp. 190-194.
14. Mitchell, D., Selman, B., & Levesque, H. (1992). Hard and easy distributions of sat problems. In Proceedings of AAAI-92, pp. 459-465.
15. Parkes, A. (1997). Clustering at the phase transition. In Proceedings of AAAI-97, pp. 340-345.
16. Prosser, P. (1996). An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81, 81-109.
17. Purdom, P. (1997). Backtracking and random constraint satisfaction. Annals of Mathematics and Artificial Intelligence, 20, 393-410.
18. Smith, B. (1999). Constructing an Asymptotic Phase Transition in Random Binary Constraint Satisfaction Problems. Extended Abstract.
19. Smith, B., & Dyer, M. (1996). Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 155-181.
20. n,m phase transition is not hard for the hamiltonian cycle problem. Journal of Artificial Intelligence Research, 9, 219-245.
21. Williams, C., & Hogg, T. (1994). Exploiting the deep structure of constraint problems. Artificial Intelligence, 70, 73-117.