Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems

Uriel Feige, Elchanan Mossel, Dan Vilenchik

Research output: Contribution to journalArticlepeer-review

Abstract

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” heuristic) works when the clause-variable ratio is a sufficiently large constant. We are not aware of previous rigorous analysis showing the effectiveness of message passing algorithms for satisfiability instances.
Original languageEnglish GB
Pages (from-to)617-651
Number of pages35
JournalTheory of Computing
Volume9
Issue number1
StatePublished - 2013

Fingerprint

Dive into the research topics of 'Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems'. Together they form a unique fingerprint.

Cite this