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

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

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== Time Complexity == 

$O({2}^n)$

== Space Complexity == 

 

()

== Description == 



== Approximate? == 

Exact

== Randomized? == 

No, deterministic

== Model of Computation == 



== Year == 

1999

== Reference == 

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/769433

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Conflict-Driven_Clause_Learning_(CDCL)_(CNF-SAT_Boolean_Satisfiability)"

Navigation menu