P, NP, and NP-Completeness : The Basics of Computational Complexity, Paperbac...
57,77 €
It also provides adequate preliminaries regarding computational problems and computational models. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness.
Jetzt bei Ebay:
![Produktbild - P, Np, and Np-Completeness: The Basics of Computational Complexity [Paperback]](https://i.ebayimg.com/thumbs/images/g/c1kAAOSwMrhlXZ5-/s-l140.jpg)
