2 search results - page 1 / 1 » A Clause String DNA Algorithm for SAT |
DNA
2001
Springer
13 years 10 months ago
2001
Springer
A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This re...
DNA
2000
Springer
13 years 9 months ago
2000
Springer
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...