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.
Ik heb een vraag over het boek:
‘P, NP, and NP-Completeness - Goldreich, Oded (Weizmann Institute of Science’.
Vul het onderstaande formulier in.
We zullen zo spoedig mogelijk antwoorden.
