Physics – Condensed Matter – Disordered Systems and Neural Networks
Scientific paper
2002-12-18
Advances in Neural Information Processing Systems. Vol 9. Oxford University Press; 2005. 424
Physics
Condensed Matter
Disordered Systems and Neural Networks
8 pages, 5 figures
Scientific paper
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.
Braunstein Alexander
Mezard Marc
Weigt Martin
Zecchina Riccardo
No associations
LandOfFree
Constraint Satisfaction by Survey Propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Constraint Satisfaction by Survey Propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint Satisfaction by Survey Propagation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-575536