- This topic is empty.
November 21, 2020 at 6:37 am #17550Ginger GantGuest
P, Np, and Np-Completeness
The Basics of Computational Complexity
by Oded Goldreich
- Format: paperback, 184 pages
- Release date: October 21, 2010
- Publisher: Cambridge University Press
- ISBN: 9780521122542 (0521122546)
- Language: english
- Genres: mathematics
- Author: Oded Goldreich
About The Book
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 unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.
Online ebook P, Np, and Np-Completeness by Oded Goldreich buy cheap on Barnes & Noble. Paperback book P, Np, and Np-Completeness read online iOS. EPUB P, Np, and Np-Completeness download on Audible. Hardcover P, Np, and Np-Completeness Oded Goldreich for reader. MOBI book P, Np, and Np-Completeness by Oded Goldreich read on IndieBound.