Browsing Mathematics (Faculty of) by Subject "CSP"
Now showing items 1-3 of 3
-
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. ... -
Randomization and Restart Strategies
(University of Waterloo, 2006)The runtime for solving constraint satisfaction problems (CSP) and propositional satisfiability problems (SAT) using systematic backtracking search has been shown to exhibit great variability. Randomization and restarts ... -
Series-Parallel Posets and Polymorphisms
(University of Waterloo, 2018-09-04)We examine various aspects of the poset retraction problem for series-parallel posets. In particular we show that the poset retraction problem for series-parallel posets that are already solvable in polynomial time are ...