A new model of hard binary constraint satisfaction problems

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

Volumn 1081, Issue , 1996, Pages 14-25

  Dent, Michael J ^a   Mercer, Robert E ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957881783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61291-2_38     Document Type: Conference Paper

References (14)

1. P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings IJCAI-91, pages 331-337, 1991.
2. J. Crawford and L. Auton. Experimental results on the crossover point in satisfiability problems. In Proceedings AAAI-93, pages 21-27, 1993.
3. M. Dent and R. Mercer. Using local graph topology to model hard binary constraint satisfaction problems. Technical Report UWO-CSD-439, The University of Western Ontario, 1995.
4. Y. Pu. The use and abuse of statistical mechanics in computational complexity. In D. Stein, editor, Lectures in the Sciences of Complexity, pages 815-826. Addison- Wesley Longman, 1989.
5. R. Haralick and G. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
6. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In Proceedings AAAI-92, pages 459-465, 1992.
7. P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268-299, 1993.
8. P. Prosser. Binary constraint satisfaction problems: Some are harder than others. In Proceedings ECAI-94, pages 95-99, 1994.
9. P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 1996. To appear.
10. B. Smith. Phase transition and the mushy region in constraint satisfaction problems. In Proceedings ECAI-94, 1994.
11. B. Smith and M. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 1996. To appear.
12. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
13. C. Williams and T. Hogg. Using deep structure to locate hard problems. In Proceedings AAAI-92, pages 472-477, 1992.
14. C. Williams and T. Hogg. Extending deep structure. In Proceedings AAAI-93, pages 152-157, 1993.