Random k-sat: the limiting probability for satisfiability for moderately growing k
From MaRDI portal
(Redirected from Publication:1010652)
Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)
Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)
Recommendations
- Random k-SAT: A tight threshold for moderately growing k
- A note on random \(k\)-SAT for moderately growing \(k\)
- On the critical exponents of random k‐SAT
- Bounds on threshold of regular random k-SAT
- Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random \(k\)-SAT
- The number of satisfying assignments of random regular k-SAT formulas
- Theory and Applications of Satisfiability Testing
- A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
- On the concentration of the number of solutions of random satisfiability formulas
Cited in
(6)- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- Random k-SAT: A tight threshold for moderately growing k
- A note on random \(k\)-SAT for moderately growing \(k\)
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- The condensation transition in random hypergraph 2-coloring
- On the phase transitions of (k, q)-SAT
This page was built for publication: Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010652)
