The number of satisfying assignments of random regular k-SAT formulas
Combinatorics, Probability & Computing, Volume abs/1611.03236, Issue 4, 2018.
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 slightly below the critical degree where the formula becomes unsatisfiable with high probability, we determine the limiting distribution of the logarithm of t...More
Full Text (Upload PDF)
PPT (Upload PPT)