The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader...
P, NP, and NP-Completeness
The Basics of Computational Complexity
US$ 32.00
(+ tax)
Preview (read now)
Add to my own site
Give this ebook to a friend
Add to my wishlist
Author's page
Publisher's page
Devices
- iPad
- PC
- e-readers with Adobe Digital Editions installed
- Mac
See the full list
Available Devices
X
This book is available for the following devices:
- iPad
- Windows
- Mac
- Sony Reader
- Cool-er Reader
- Nook
- Kobo Reader
- iRiver Story
File Formats
Download: secure PDF.
You can also read this book online in eb20 format without having to download anything.
You can also read this book online in eb20 format without having to download anything.
Permissions
Printing
Copy/Paste
Read Aloud
Printing
Copy/Paste
Read Aloud
more
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.
less
Cambridge University Press; September 2010
216 pages; ISBN 9780511903908
Read online, or download in secure PDF format
216 pages; ISBN 9780511903908
Read online, or download in secure PDF format
Subject categories
ISBNs
0511903901
9780511903908
9780521192484

