Notions of average-case complexity for random 3-SAT
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1445295
- Randomized algorithms for 3-SAT
- Bounding the unsatisfiability threshold of random 3-SAT
- A randomized algorithm for 3-SAT
- Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
- scientific article; zbMATH DE number 437557
- Average case results for satisfiability algorithms under the random-clause-width model
- On Average Case Complexity of SAT for Symmetric Distribution
- Hard random 3-SAT problems and the Davis-Putnam procedure
Cited in
(2)
This page was built for publication: Notions of average-case complexity for random 3-SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311247)