Search
Skip to Search Results
Filter
Author / Creator / Contributor
Subject / Keyword
Departments
Year
Collections
Languages
Item type
-
Spring 2022
Boolean Satisfiability (SAT) is a well-known NP-complete problem. Despite the theoretical hardness of SAT, backtracking search based Conflict Directed ClauseLearning (CDCL) SAT solvers can solve very large real-world SAT instances with surprising efficiency. The high efficiency of CDCL SAT...
1 - 1 of 1