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

Physica A: Statistical Mechanics and its Applications

Volumn 306, Issue , 2002, Pages 381-394

  Biroli, Giulio ^a   Cocco, Simona ^b   Monasson, Rémi ^c,d  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c LABORATOIRE DE PHYSIQUE STATISTIQUE   (France)

^d UNIVERSITY OF CHICAGO   (United States)

Author keywords

Analysis of algorithm; Optimization; Phase transitions; Satisfiability; Statistical physics

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PHASE TRANSITIONS; STATISTICAL MECHANICS;

CONDENSED MATTER PHYSICS; RANDOM SATISFIABILITY PROBLEM; STASTICAL PHYSICS;

COMPUTER SCIENCE;

EID: 0036540557     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-4371(02)00516-2     Document Type: Conference Paper

References (15)

1. Can't get satisfaction
2. Computational complexity for physicists
3. Determining computational complexity from characteristic phase transitions
4. Statistical mechanics methods and phase transitions in optimization problems
5. Entropy of the K-Satisfiability problem
6. A variational description of the ground-state structure in random satisfiability problems
7. Trajectories in phase diagrams, growth processes and computational complexity: How search algorithms solve the 3-Satisfiability problem
8. Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms
9. Probabilistic analysis of two heuristics for the 3-satisfiability problem
10. Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
11. Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs
12. A backbone-search heuristic for efficient solving of hard 3-SAT formulae