search for books and compare prices
Price
Store
Arrives
Preparing
Shipping
Jump quickly to results on these stores:
The price is the lowest for any condition, which may be new or used; other conditions may also be available.
Jump down to see edition details for: Paperback
Bibliographic Detail
Publisher
Cambridge Univ Pr
Publication date
August 16, 2010
Pages
184
Binding
Paperback
Book category
Adult Non-Fiction
ISBN-13
9780521122542
ISBN-10
0521122546
Dimensions
0.50 by 6 by 9 in.
Weight
0.65 lbs.
Original list price
$44.99
Amazon.com says people who bought this book also bought:
Combined Answer Book For Calculus Third and Fourth Editions | Foundations of Cryptography | Prime Numbers and the Riemann Hypothesis | Computational Complexity | The Go Programming Language | Computers and Intractability | Introduction to Graph Theory | The Golden Ticket | Think Complexity
Combined Answer Book For Calculus Third and Fourth Editions | Foundations of Cryptography | Prime Numbers and the Riemann Hypothesis | Computational Complexity | The Go Programming Language | Computers and Intractability | Introduction to Graph Theory | The Golden Ticket | Think Complexity
Summaries and Reviews
Amazon.com description: Product Description: 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.
Editions
Paperback
The price comparison is for this edition
from Cambridge Univ Pr (August 16, 2010)
9780521122542 | details & prices | 184 pages | 6.00 × 9.00 × 0.50 in. | 0.65 lbs | List price $44.99
About: The focus of this book is the P-versus-NP Question and the theory of NP-completeness.
About: The focus of this book is the P-versus-NP Question and the theory of NP-completeness.
Pricing is shown for items sent to or within the U.S., excluding shipping and tax. Please consult the store to determine exact fees. No warranties are made express or implied about the accuracy, timeliness, merit, or value of the information provided. Information subject to change without notice. isbn.nu is not a bookseller, just an information source.