Conflict-Driven Clause Learning (CDCL) (CNF-SAT Boolean Satisfiability)

From Algorithm Wiki

Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1999 == Reference == https://ieeexplore.ieee.org/document/769433")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O({2}^n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1999

Reference

https://ieeexplore.ieee.org/document/769433

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Conflict-Driven_Clause_Learning_(CDCL)_(CNF-SAT_Boolean_Satisfiability)&oldid=45621"