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

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

by OdedGoldreich (Author)

Synopsis

Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.

$134.73

Quantity

20+ in stock

More Information

Format: Hardcover
Pages: 214
Edition: 1
Publisher: Cambridge University Press
Published: 16 Aug 2010

ISBN 10: 052119248X
ISBN 13: 9780521192484