184
click to vote
TAINN
15 years 10 months ago
2005 Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
|