Constraint Satisfaction by Survey Propagation

Abstract

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.

8 pages, 5 figures

Cited by in corpus (5)

• Survey Propagation as local equilibrium equations
• Iterative Quantization Using Codes On Graphs
• The large deviations of the whitening process in random constraint satisfaction problems
• A New Look at Survey Propagation and its Generalizations
• Optimization and Physics: On the satisfiability of random Boolean formulae