Projects per year
Abstract
Let Φ be a random kSAT 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.
Original language  English 

Pages (fromto)  496530 
Number of pages  35 
Journal  Combinatorics, Probability and Computing 
Volume  27 
Issue number  4 
DOIs  
Publication status  Published  1 Jul 2018 
Projects
 1 Finished

Advances in the analysis of random structures and their applications: relationships among models
Australian Research Council (ARC)
1/08/12 → 31/12/17
Project: Research