Constraint Satisfaction by Survey Propagation

A. Braunstein (1) , M. Mezard (2) , M. Weigt (3) , R. Zecchina (1)

1 ICTP - Abdus Salam International Centre for Theoretical Physics [Trieste]
2 LPTMS - Laboratoire de Physique Théorique et Modèles Statistiques
3 Institute for Scientific Interchange

Survey Propagation is an algorithm designed for solving typical instances of random constraint satisfiability problems. It has been successfully tested on random 3-SAT and random $G(n,\frac{c}{n})$ graph 3-coloring, in the hard region of the parameter space. Here we provide a generic formalism which applies to a wide class of discrete Constraint Satisfaction Problems.

Domaines: Complexité [cs.CC]; Autre [cond-mat.other]

A. Braunstein, M. Mezard, M. Weigt, R. Zecchina. Constraint Satisfaction by Survey Propagation. Computational Complexity and Statistical Physics, 2006, 107, part 2 : 4. ⟨hal-00115530⟩