Paper Info
Title
The number of satisfying assignments of random regular k-SAT formulas.
Abstract
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 number of satisfying assignments.
Year
DOI
Venue
2018
10.1017/S0963548318000263
COMBINATORICS PROBABILITY & COMPUTING
DocType
Volume
Issue
Journal
27
SP4
ISSN
Citations 
PageRank 
0963-5483
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Amin Coja-Oghlan154347.25
Nick Wormald241.81