The Leading eBooks Store Online

for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader ...

New to eBooks.com?

Learn more

P, NP, and NP-Completeness

The Basics of Computational Complexity

P, NP, and NP-Completeness
Add to cart
US$ 34.00
(If any tax is payable it will be calculated and shown at checkout.)
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.
Cambridge University Press; August 2010
216 pages; ISBN 9780511903908
Read online, or download in secure PDF format