Constraint Satisfaction by Survey Propagation
A. Braunstein 1, M. Mezard 2, M. Weigt 3, R. Zecchina 1 Computational Complexity and Statistical Physics 107 (2006) part 2 : 4 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 […]
Constraint Satisfaction by Survey Propagation Lire la suite »