Oded Goldreich
Broschiertes Buch

P, NP, and NP-Completeness

The Basics of Computational Complexity

Versandkostenfrei!
Versandfertig in 1-2 Wochen
52,99 €
inkl. MwSt.
Weitere Ausgaben:
PAYBACK Punkte
26 °P sammeln!
The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains un...