2010. 1st Edition. Paperback. Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness. Num Pages: 216 pages, 18 b/w illus. 94 exercises. BIC Classification: UYA. Category: (UU) Undergraduate. Dimension: 228 x 156 x 13. Weight in Grams: 336. The Basics of Computational Complexity. 214 pages, 18 b/w illus. 94 exercises. Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness. Cateogry: (UU) Undergraduate. BIC Classification: UYA. Dimension: 228 x 156 x 13. Weight: 330. . . . . .

Seller Inventory # V9780521122542

Contact seller

Report this item

Bibliographic Details

Title: P, NP, and NP-Completeness: The Basics of Computational Complexity
Publisher: Cambridge University Press
Publication Date: 2010
Language: English
ISBN 10: 0521122546
ISBN 13: 9780521122542
Binding: Soft cover
Edition: 1st Edition
Condition: New

About this title

Synopsis

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.

About the Author

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.

"About this title" may belong to another edition of this title.

Store Description

Kennys.ie is the largest exporter of books from Ireland currently exporting to approximately 100 countries around the world. Kennys Bookshop houses hundreds of thousands of books and specialises in collection development and library services, supplying booksellers and state and university libraries on a global scale including the U.S.A.,Japan and Europe. Kennys.ie is Ireland's Largest Online Bookshop.

Visit Seller's Storefront

Seller's business information

Kennys Bookshop and Art Galleries Ltd.
Liosban Business Park, Tuam Rd, Galway City, H91 N5P8, Ireland

Sale & Shipping Terms

Terms of Sale

Terms of Sale - Credit Cards: Visa, Master Card, American Express, Diner.
Payment can also be made by bank draft in Euros, drawn on an Irish Bank.

We regret that PO Boxes are not acceptable to the U.S. as our courier will not deliver to them.

In case of returns or queries please contact us by email books@kennys.ie or by phone +353 91 709350

VAT Registration - IE2238521A

Conor Kenny

Shipping Terms

Free Shipping

Shipping rates from Ireland to U.S.A.

Shipping rates from Ireland to U.S.A.
Order quantity	12 to 22 business days	10 to 20 business days
First item	US$ 11.08	US$ 13.42

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.