Constraint Satisfaction by Survey Propagation
Disordered Systems and Neural Networks
2010-04-02 v3 Computational Complexity
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 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.
Cite
@article{arxiv.cond-mat/0212451,
title = {Constraint Satisfaction by Survey Propagation},
author = {A. Braunstein and M. Mezard and M. Weigt and R. Zecchina},
journal= {arXiv preprint arXiv:cond-mat/0212451},
year = {2010}
}
Comments
8 pages, 5 figures