arXiv · cond-mat/0212451
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
A. Braunstein, M. Mezard, M. Weigt, R. Zecchina. 2003-09-27. Constraint Satisfaction by Survey Propagation. https://arxiv.org/abs/cond-mat/0212451
Cite the original work for its findings. Save a collection to share your selection of sources.