The Number of Satisfying Assignments of Random Regulark-SAT Formulas
From MaRDI portal
Publication:3177360
DOI10.1017/S0963548318000263zbMath1393.60010arXiv1611.03236MaRDI QIDQ3177360
Amin Coja-Oghlan, Nicholas C. Wormald
Publication date: 24 July 2018
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03236
Related Items
On the number of solutions in random hypergraph 2-colouring, A General Framework for Hypergraph Coloring, Counting Solutions to Random CNF Formulas, The number of satisfying assignments of random 2‐SAT formulas, Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth, One-step replica symmetry breaking of random regular NAE-SAT. II, Charting the replica symmetric phase, Unnamed Item, The replica symmetric phase of random constraint satisfaction problems, Belief propagation on the random \(k\)-SAT model, Solving non-uniform planted and filtered random SAT formulas greedily
Cites Work
- Unnamed Item
- Unnamed Item
- The asymptotic \(k\)-SAT threshold
- An elementary proof of the local central limit theorem
- Random \(k\)-SAT: A tight threshold for moderately growing \(k\)
- On the number of solutions in random hypergraph 2-colouring
- Proof of the Satisfiability Conjecture for Large k
- Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
- An estimate of the remainder in a combinatorial central limit theorem
- Almost all cubic graphs are Hamiltonian
- Approximating the unsatisfiability threshold of random formulas
- The condensation phase transition in the regular $k$-SAT model
- Paths in graphs
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
- Random Regular Graphs: Asymptotic Distributions and Contiguity
- Bounds on Threshold of Regular Random k-SAT
- Satisfiability threshold for random regular NAE-SAT
- Going after the k-SAT threshold
- The condensation transition in random hypergraph 2-coloring
