P, NP, and NP-Completeness - The Basics of Computational Complexity (Hardcover, New)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	August 2010
First published:	August 2010
Authors:	Oded Goldreich
Dimensions:	229 x 147 x 18mm (L x W x T)
Format:	Hardcover
Pages:	216
Edition:	New
ISBN-13:	978-0-521-19248-4
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Promotions
LSN:	0-521-19248-X
Barcode:	9780521192484

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!