The random 2-SAT partition function

02/10/2020

∙

We show that throughout the satisfiable phase the normalised number of satisfying assignments of a random 2-SAT formula converges in probability to an expression predicted by the cavity method from statistical physics. The proof is based on showing that the Belief Propagation algorithm renders the correct marginal probability that a variable is set to `true' under a uniformly random satisfying assignment.

READ FULL TEXT

The random 2-SAT partition function

The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials

Belief Propagation on the random k-SAT model

Streamlining Variational Inference for Constraint Satisfaction Problems

Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem

NSNet: A General Neural Probabilistic Framework for Satisfiability Problems

The Long, the Short and the Random

Introducing Autarkies for DQCNF

The random 2-SAT partition function

Related Research

The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials

Belief Propagation on the random k-SAT model

Streamlining Variational Inference for Constraint Satisfaction Problems

Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem

NSNet: A General Neural Probabilistic Framework for Satisfiability Problems

The Long, the Short and the Random

Introducing Autarkies for DQCNF