DNA
2001
Springer
14 years 5 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...