Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems
Computational Complexity
2008-02-04 v1 Statistical Mechanics
Abstract
We review the understanding of the random constraint satisfaction problems, focusing on the q-coloring of large random graphs, that has been achieved using the cavity method of the physicists. We also discuss the properties of the phase diagram in temperature, the connections with the glass transition phenomenology in physics, and the related algorithmic issues.
Cite
@article{arxiv.0711.0110,
title = {Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems},
author = {Florent Krzakala and Lenka Zdeborová},
journal= {arXiv preprint arXiv:0711.0110},
year = {2008}
}
Comments
10 pages, Proceedings of the International Workshop on Statistical-Mechanical Informatics 2007, Kyoto (Japan) September 16-19, 2007