Phase transitions and computational difficulty in random constraint satisfaction problems

被引：11
|
作者：
Krzakala, Florent [1 ]
Zdeborova, Lenka [2 ]
机构：
[1] UMR Gulliver 7083 CNRS ESPCI, PCT, 10 Rue Vauquelin, F-75231 Paris, France
[2] Univ Paris 11, CNRS, LPTMS, F-91405 Orsay, France
来源：
INTERNATIONAL WORKSHOP ON STATISTICAL-MECHANICAL INFORMATICS 2007 (IW-SMI 2007) | 2008年 / 95卷
关键词：
D O I：
10.1088/1742-6596/95/1/012012
中图分类号：
O59 [应用物理学];
学科分类号：
摘要：
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.
引用
收藏
页数：10
相关论文
共 50 条
12345