P, Np, and Np-Completeness: The Basics of Computational Complexity

The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides...
€221,07 EUR
€221,07 EUR
SKU: 9780521192484
Product Type: Books
Please hurry! Only 555 left in stock
Author: Oded Goldreich
Format: Hardcover
Language: English
Subtotal: €221,07
10 customers are viewing this product
P, Np, and Np-Completeness: The Basics of Computational Complexity by Goldreich, Oded

P, Np, and Np-Completeness: The Basics of Computational Complexity

€221,07

P, Np, and Np-Completeness: The Basics of Computational Complexity

€221,07
Author: Oded Goldreich
Format: Hardcover
Language: English
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.

Author: Oded Goldreich
Publisher: Cambridge University Press
Published: 08/16/2010
Pages: 216
Binding Type: Hardcover
Weight: 0.90lbs
Size: 9.00h x 5.80w x 0.70d
ISBN: 9780521192484


Review Citation(s):
Choice 02/01/2011

About the Author
Goldreich, Oded: - Oded Goldreich is a Professor of Computer Science at the Weizmann Institute of Science and an incumbent of the Meyer W. Weisgal Professorial Chair. He is an editor for the SIAM Journal on Computing, the Journal of Cryptology, and Computational Complexity and previously authored the books Modern Cryptography, Probabilistic Proofs and Pseudorandomness, the two-volume work Foundations of Cryptography, and Computational Complexity: A Conceptual Perspective.

Returns Policy

You may return most new, unopened items within 30 days of delivery for a full refund. We'll also pay the return shipping costs if the return is a result of our error (you received an incorrect or defective item, etc.).

You should expect to receive your refund within four weeks of giving your package to the return shipper, however, in many cases you will receive a refund more quickly. This time period includes the transit time for us to receive your return from the shipper (5 to 10 business days), the time it takes us to process your return once we receive it (3 to 5 business days), and the time it takes your bank to process our refund request (5 to 10 business days).

If you need to return an item, simply login to your account, view the order using the "Complete Orders" link under the My Account menu and click the Return Item(s) button. We'll notify you via e-mail of your refund once we've received and processed the returned item.

Shipping

We can ship to virtually any address in the world. Note that there are restrictions on some products, and some products cannot be shipped to international destinations.

When you place an order, we will estimate shipping and delivery dates for you based on the availability of your items and the shipping options you choose. Depending on the shipping provider you choose, shipping date estimates may appear on the shipping quotes page.

Please also note that the shipping rates for many items we sell are weight-based. The weight of any such item can be found on its detail page. To reflect the policies of the shipping companies we use, all weights will be rounded up to the next full pound.

Related Products

Recently Viewed Products