An average case analysis of the branching algorithm for solving k-satisfiability problems
From MaRDI portal
(Redirected from An average case analysis of the branching algorithm for solving k-satisfiability problems)
An average case analysis of the branching algorithm for solving \(k\)-satisfiability problems
An average case analysis of the branching algorithm for solving \(k\)-satisfiability problems
Recommendations
- A probabilistic algorithm for k-SAT based on limited local search and restart
- Solving satisfiability in less than \(2^ n\) steps
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
- scientific article; zbMATH DE number 30299
- CNF-Satisfiability Test by Counting and Polynomial Average Time
Cited in
(3)
This page was built for publication: An average case analysis of the branching algorithm for solving \(k\)-satisfiability problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953355)