The number of satisfying assignments of random regular k-SAT formulas

Amin Coja-Oghlan, Nick Wormald

Let $\Phi$ be a random $k$-SAT formula in which every variable occurs precisely $d$ times positively and $d$ times negatively. Assuming that $k$ is sufficiently large and that $d$ is…