The Number of Satisfying Assignments of Random Regulark-SAT Formulas

Abstract

Let Φ be a randomk-SAT formula in which every variable occurs preciselydtimes positively anddtimes negatively. Assuming thatkis sufficiently large and thatdis slightly below the critical degree where the formula becomes unsatisfiable with high probability, we determine the limiting distribution of the number of satisfying assignments.