A Survey of Lower Bounds for Satisfiability and Related Problems by Dieter van M
100,18 €
It is the first problem that was shown to be NP-complete, and is possibly the most commonly studied NP-complete problem, both for its theoretical properties and its applications in practice. NP-completeness arguably forms the most pervasive concept from computer science as it captures the computational complexity of thousands of important problems from all branches of science and engineering.
Jetzt bei Ebay:
