P, NP, and NP-Completeness PDF (Adobe DRM) download by Oded Goldreich

P, NP, and NP-Completeness

Cambridge University Press
Publication date: August 2006
ISBN: 9780511903908
Digital Book format: PDF (Adobe DRM)

Buy PDF

List price:
$36.00
Our price:
$33.99

You save: $2.01 (6%)
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.
Please sign in to review this product.
Format:
Devices:
P, NP, and NP-Completeness PDF (Adobe DRM) can be read on any device that can open PDF (Adobe DRM) files.

File Size:
1093 Kb
Language:
ENG
Copy From Text:
Enabled. Limit of 5 selections within 30 days.
Printing:
Enabled. Limit of 20 pages within 30 days.
Other books by Oded Goldreich
Foundations of Cryptography PDF (Adobe DRM) download by Oded Goldreich
Foundations of Cryptography
Oded Goldreich
Cambridge University Press, October 1997
ISBN: 9780521791724
Format: PDF
List Price: $50.00 Our price: $46.99
Recently Viewed Products