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
关键词
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 条
  • [41] On the Solution-Space Geometry of Random Constraint Satisfaction Problems
    Achlioptas, Dimitris
    Coja-Oghlan, Amin
    Ricci-Tersenghi, Federico
    RANDOM STRUCTURES & ALGORITHMS, 2011, 38 (03) : 251 - 268
  • [42] Circumspect descent prevails in solving random constraint satisfaction problems
    Alava, Mikko
    Ardelius, John
    Aurell, Erik
    Kaski, Petteri
    Krishnamurthy, Supriya
    Orponen, Pekka
    Seitz, Sakari
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2008, 105 (40) : 15253 - 15257
  • [43] A DICHOTOMY THEOREM FOR THE RESOLUTION COMPLEXITY OF RANDOM CONSTRAINT SATISFACTION PROBLEMS
    Chan, Siu On
    Molloy, Michael
    SIAM JOURNAL ON COMPUTING, 2013, 42 (01) : 27 - 60
  • [44] The large deviations of the whitening process in random constraint satisfaction problems
    Braunstein, Alfredo
    Dall'Asta, Luca
    Semerjian, Guilhem
    Zdeborova, Lenka
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2016,
  • [45] CRITICALITY AND HETEROGENEITY IN THE SOLUTION SPACE OF RANDOM CONSTRAINT SATISFACTION PROBLEMS
    Zhou, Haijun
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2010, 24 (18): : 3479 - 3487
  • [46] Locating the phase transition in binary constraint satisfaction problems
    Smith, BM
    Dyer, ME
    ARTIFICIAL INTELLIGENCE, 1996, 81 (1-2) : 155 - 181
  • [47] Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction
    Jonsson, Peter
    Lagerkvist, Victor
    Nordh, Gustav
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2013, 2013, 8124 : 398 - 414
  • [48] Decimation Algorithm Based on Correlations for Constraint Satisfaction Problems on Random Networks
    Higuchi, Saburo
    2009 7TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS, 2009, : 473 - 477
  • [49] Resolution complexity of random constraint satisfaction problems: Another half of the story
    Gao, Y
    Culberson, J
    DISCRETE APPLIED MATHEMATICS, 2005, 153 (1-3) : 124 - 140
  • [50] The solution space structure of random constraint satisfaction problems with growing domains
    Xu, Wei
    Zhang, Pan
    Liu, Tian
    Gong, Fuzhou
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2015,