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.
|Book:||P, Np, And Np-Completeness: The Basics Of Computational Complexity|
|Publisher:||Cambridge University Press|
|Number of Pages:||214|
Please Note -
* We sell only NEW book and do NOT sell old or used books.
* The book images and summary displayed may be of a different edition or binding of the same title.
* Book reviews are not added by BookAdda.
* Price can change due to reprinting, price change by publisher / distributor.
BookAdda (www.bookadda.com) is a premier online book store in selling books online across India at the most competitive prices. BookAdda sells fiction, business, non fiction, literature, AIEEE, medical, engineering, computer book, etc. The books are delivered across India FREE of cost.