Estimating satisfiability
From MaRDI portal
Recommendations
- On variable-weighted exact satisfiability problems
- SOFSEM 2005: Theory and Practice of Computer Science
- Solving satisfiability problems using elliptic approximations. A note on volumes and weights
- scientific article; zbMATH DE number 2090009
- Counting All Solutions of Minimum Weight Exact Satisfiability
Cites work
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 1445295 (Why is no real title available?)
- A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
- A new look at survey propagation and its generalizations
- Almost all graphs with 2. 522\(n\) edges are not 3-colorable
- Approximating the unsatisfiability threshold of random formulas
- Non uniform selection of solutions for upper bounding the 3-SAT threshold
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
- On the satisfiability threshold of formulas with three literals per clause
- On the solution-space geometry of random constraint satisfaction problems
- Pruning processes and a new characterization of convex geometries
- Random constraint satisfaction: A more accurate picture
- Regular random \(k\)-SAT: Properties of balanced formulas
- Tail bounds for occupancy and the satisfiability threshold conjecture
- The unsatisfiability threshold revisited
Cited in
(2)
This page was built for publication: Estimating satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765341)
