P, NP, and NP-Completeness The Basics of Computational Complexity |
|
| Author:
| Goldreich, Oded |
| ISBN: | 978-0-521-19248-4 |
| Publication Date: | Aug 2010 |
| Publisher: | Cambridge University Press
|
| Book Format: | Hardback |
| List Price: | USD $119.00 |
Book Description:
|
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.
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.