Constraint Satisfaction by Survey Propagation
<|reference_start|>Constraint Satisfaction by Survey Propagation: 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.<|reference_end|>
@article{braunstein2002constraint,
    title={Constraint Satisfaction by Survey Propagation},
    author={A. Braunstein, M. Mezard, M. Weigt and R. Zecchina},
    journal={Advances in Neural Information Processing Systems. Vol 9. Oxford
  University Press; 2005. 424},
    year={2002},
    archivePrefix={arXiv},
    eprint={cond-mat/0212451},
    primaryClass={cond-mat.dis-nn cs.CC}
}