Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems

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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00304225
Contributor : Claudine Le Vaou <>
Submitted on : Tuesday, July 22, 2008 - 4:14:18 PM
Last modification on : Thursday, January 11, 2018 - 6:14:29 AM

Links full text

Identifiers

  • HAL Id : hal-00304225, version 1
  • ARXIV : 0711.0110

Collections

Citation

Florent Krzakala, Lenka Zdeborová. Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems. Journal of Physics: Conference Series, IOP Publishing, 2008, 95, pp.012012. ⟨hal-00304225⟩

Share

Metrics

Record views

280