Belief and Survey Propagation
Talkat 50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing · 2021-02-11..05-13
summary
Experimental survey propagation beats classic solvers on random 4‑SAT but later analysis shows the message‑passing decimation idea stalls roughly a factor K below the satisfiability threshold (threshold ~2^K log 2, clustering at ~2^K log K / K). Heuristic physics formulas become a closed variational problem; the interpolation and second‑moment techniques prove the threshold prediction for large K (Ding‑Sly‑Sun), while belief propagation is shown to correctly approximate marginals and counts for random 2‑SAT up to density 1.
AI-written summary · about
