Davis-Putnam-Logemann-Loveland Algorithm (DPLL) (CNF-SAT Boolean Satisfiability)

From Algorithm Wiki
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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/doi/10.1145/368273.368557")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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/doi/10.1145/368273.368557

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Davis-Putnam-Logemann-Loveland_Algorithm_(DPLL)_(CNF-SAT_Boolean_Satisfiability)&oldid=45620"