Now showing items 1-3 of 3

    • Backdoors in Satisfiability Problems 

      Li, Zijie (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 

      Wu, Huayue (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 

      Song, Renzhi (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 ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages