Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems

@inproceedings{Feige2006CompleteCO,
  title={Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems},
  author={Uriel Feige and Elchanan Mossel and Dan Vilenchik},
  booktitle={APPROX-RANDOM},
  year={2006}
}
In this paper we analyze the performance of Warning Propagation, a popular message passing algorithm. We show that for 3CNF formulas drawn from a certain distribution over random satisfiable 3CNF formulas, commonly referred to as the planted-assignment distribution, running Warning Propagation in the standard way (run message passing until convergence, simplify the formula according to the resulting assignment, and satisfy the remaining subformula, if necessary, using a simple “off the shelf… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-10 of 11 references

AND RICCARDO ZECCHINA: Survey propagation: An algorithm for satisfiability

  • ALFREDO BRAUNSTEIN, MARC MÉZARD
  • Random Structures & Algorithms, 27(2):201–226
  • 2005
Highly Influential
3 Excerpts

AND DAN VILENCHIK: Complete convergence of message passing algorithms for some satisfiability problems

  • URIEL FEIGE, ELCHANAN MOSSEL
  • Proc. 10th Internat. Workshop on Randomization…
  • 2006
1 Excerpt

AND EFTHIMIOS G

  • ALEXIS C. KAPORIS, LEFTERIS M. KIROUSIS
  • LALAS: The probabilistic analysis of a greedy…
  • 2006

AND DANIEL A

  • MICHAEL LUBY, MICHAEL MITZENMACHER, AMIN SHOKROLLAHI
  • SPIEL- MAN: Efficient erasure correcting codes…
  • 2001
1 Excerpt