2 search results - page 1 / 1 » Faster Exact Solving of SAT Formulae with a Low Number of Oc... |
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We present an algorithm that decides the satisfiability of a
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...