Counting solutions to random CNF formulas
From MaRDI portal
Cites work
- A better algorithm for random \(k\)-SAT
- A constructive proof of the general Lovász local lemma
- A parallel algorithmic version of the local lemma
- Analysing survey propagation guided decimationon random formulas
- Analyzing Walksat on random formulas
- Approximate counting, the Lovász local lemma, and inference in graphical models
- Approximating the unsatisfiability threshold of random formulas
- Approximation via Correlation Decay When Strong Spatial Mixing Fails
- Asymptotic lower bounds for Ramsey functions
- Belief propagation guided decimation fails on random formulas
- Component structure in the evolution of random hypergraphs
- Counting good truth assignments of random k-SAT formulae
- Counting hypergraph colorings in the local lemma regime
- Counting Independent Sets and Colorings on Random Regular Bipartite Graphs
- Deterministic algorithms for the Lovász local lemma
- Exact thresholds for Ising-Gibbs samplers on general graphs
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- New constructive aspects of the Lovász local lemma
- On the concentration of the number of solutions of random satisfiability formulas
- Probability and Computing
- Proof of the satisfiability conjecture for large k
- Rapid mixing of hypergraph independent sets
- Sampling in Potts model on sparse random graphs
- Sampling random colorings of sparse random graphs
- Sharp thresholds of graph properties, and the k-sat problem
- The asymptotic k-SAT threshold
- The number of satisfying assignments of random regular k-SAT formulas
- The number of solutions for random regular NAE-SAT
- The threshold for random k-SAT is 2 k (ln 2 - O(k))
- Uniform sampling through the Lovász local lemma
- Walksat Stalls Well Below Satisfiability
This page was built for publication: Counting solutions to random CNF formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842520)
