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. 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.
Journal of Physics Conference Series
- Pub Date:
- January 2008
- Computer Science - Computational Complexity;
- Condensed Matter - Statistical Mechanics
- 10 pages, Proceedings of the International Workshop on Statistical-Mechanical Informatics 2007, Kyoto (Japan) September 16-19, 2007