Browsing Mathematics (Faculty of) by Subject "Backdoors"
Now showing items 1-2 of 2
-
Backdoors in Satisfiability Problems
(University of Waterloo, 2009-10-08)Although satisfiability problems (SAT) are NP-complete, state-of-the-art SAT solvers are able to solve large practical instances. The notion of backdoors has been introduced to capture structural properties of instances. ... -
Understanding and Enhancing CDCL-based SAT Solvers
(University of Waterloo, 2018-08-02)Modern conflict-driven clause-learning (CDCL) Boolean satisfiability (SAT) solvers routinely solve formulas from industrial domains with millions of variables and clauses, despite the Boolean satisfiability problem being ...