P, NP, and NP-Completeness

Name: P, NP, and NP-Completeness
Author: Israel) Oded (Weizmann Institute of Science Goldreich

Israel) Oded (Weizmann Institute of Science Goldreich

Cambridge University Press

Knihu koupíte v 1 e-shopu

Bookshop.cz

1 313 Kč

Není skladem

Do obchodu

a 1 další varianta

Krátký popis

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.

Výběr knih autora Israel) Oded (Weizmann Institute of Science Goldreich