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.
I have a question about the book:
‘P, NP, and NP-Completeness - Goldreich, Oded (Weizmann Institute of Science’.
Fill in the form below.
We will respond as fast as possible.
