Reweighted Belief Propagation and Quiet Planting for Random K-SAT
Florent Krząkała, Marc Mézard, Lenka Zdeborová · Journal on Satisfiability Boolean Modeling and Computation · 2014
We study the random K -satisfiability problem using a partition function where each solution is reweighted according to the number of variables that satisfy every clause. We apply belief propagation and the related cavity method to the reweighted par