Browsing Electrical and Computer Engineering by Subject "SAT solving"
Now showing items 1-1 of 1
-
Understanding and Improving SAT Solvers via Proof Complexity and Reinforcement Learning
(University of Waterloo, 2023-12-18)Despite the fact that the Boolean satisfiability (SAT) problem is NP-complete and believed to be intractable, SAT solvers are routinely used by practitioners to solve hard problems in wide variety of fields such as software ...