P, NP, and NP-Completeness: The Basics of Computational Complexity
by Oded Goldreich
- New
- Paperback
- Condition
- New
- ISBN 10
- 0521122546
- ISBN 13
- 9780521122542
- Seller
-
Southport, Merseyside, United Kingdom
10 Copies Available from This Seller
(You can add more at checkout.)
Payment Methods Accepted
About This Item
Paperback / softback. New. This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P versus NP Question and the theory of NP-completeness.
Reviews
(Log in or Create an Account first!)
Details
- Bookseller
- The Saint Bookstore (GB)
- Bookseller's Inventory #
- B9780521122542
- Title
- P, NP, and NP-Completeness: The Basics of Computational Complexity
- Author
- Oded Goldreich
- Format/Binding
- Paperback / softback
- Book Condition
- New New
- Quantity Available
- 10
- Binding
- Paperback
- ISBN 10
- 0521122546
- ISBN 13
- 9780521122542
- Publisher
- Cambridge University Press
- This edition first published
- 2010-08
Terms of Sale
The Saint Bookstore
Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.
About the Seller
The Saint Bookstore
Biblio member since 2018
Southport, Merseyside
About The Saint Bookstore
The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.
Glossary
Some terminology that may be used in this description includes:
- New
- A new book is a book previously not circulated to a buyer. Although a new book is typically free of any faults or defects, "new"...