An empirical study of phase transitions in binary constraint satisfaction problems
- 1 March 1996
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 81 (1-2) , 81-109
- https://doi.org/10.1016/0004-3702(95)00048-8
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Locating the phase transition in binary constraint satisfaction problemsArtificial Intelligence, 1996
- Foundations of Constraint Satisfaction.Journal of the Operational Research Society, 1995
- Exploiting the deep structure of constraint problemsArtificial Intelligence, 1994
- The hardest constraint problems: A double phase transitionArtificial Intelligence, 1994
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- THE TYPICALITY OF PHASE TRANSITIONS IN SEARCHComputational Intelligence, 1993
- Partial constraint satisfactionArtificial Intelligence, 1992
- Search rearrangement backtracking and polynomial average timeArtificial Intelligence, 1983
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Backtrack ProgrammingJournal of the ACM, 1965