Davis-Putnam-Logemann-Loveland Algorithm (DPLL) (CNF-SAT Boolean Satisfiability)
Jump to navigation
Jump to search
Time Complexity
$O({2}^n)$
Space Complexity
$O(n)$ Binary Search Tree
(https://en.wikipedia.org/wiki/DPLL_algorithm)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1961
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/368273.368557