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.
Type de document :
Article dans une revue
Journal of Physics: Conference Series, IOP Publishing, 2008, 95, pp.012012
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00304225
Contributeur : Claudine Le Vaou <>
Soumis le : mardi 22 juillet 2008 - 16:14:18
Dernière modification le : jeudi 11 janvier 2018 - 06:14:29

Lien texte intégral

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

242