Refining the phase transition in combinatorial search
- 31 March 1996
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 81 (1-2) , 127-154
- https://doi.org/10.1016/0004-3702(95)00050-x
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- An empirical study of phase transitions in binary constraint satisfaction problemsArtificial Intelligence, 1996
- Exploiting the deep structure of constraint problemsArtificial Intelligence, 1994
- The hardest constraint problems: A double phase transitionArtificial Intelligence, 1994
- THE TYPICALITY OF PHASE TRANSITIONS IN SEARCHComputational Intelligence, 1993
- The solution of some random NP-hard problems in polynomial expected timeJournal of Algorithms, 1989
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988
- Phase transitions in artificial intelligence systemsArtificial Intelligence, 1987
- Optimization by Simulated AnnealingScience, 1983
- Models of Network StructureAnnual Review of Sociology, 1980
- A technique for colouring a graph applicable to large scale timetabling problemsThe Computer Journal, 1969