Phase transitions and complexity in computer science: an overview of the statistical physics approach to the random satisfiability problem

被引:20
|
作者
Biroli, G
Cocco, S
Monasson, R
机构
[1] ENS, CNRS, Phys Theor Lab, F-75005 Paris, France
[2] Rutgers State Univ, Dept Phys & Astron, Ctr Mat Theory, Piscataway, NJ 08854 USA
[3] Univ Illinois, Dept Phys, Chicago, IL 60607 USA
[4] Univ Chicago, James Franck Inst, Chicago, IL 60637 USA
关键词
statistical physics; phase transitions; optimization; satisfiability; analysis of algorithm;
D O I
10.1016/S0378-4371(02)00516-2
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Phase transitions, ubiquitous in condensed matter physics, are encountered in computer science too. The existence of critical phenomena has deep consequences on computational complexity, that is the resolution times of various optimization or decision problems, Concepts and methods borrowed from the statistical physics of disordered and out-of-equilibrium systems shed new light on the dynamical operation of solving algorithms. (C) 2002 Published by Elsevier Science B.V.
引用
收藏
页码:381 / 394
页数:14
相关论文
共 50 条