P, NP, and NP-Completeness
The Basics of Computational Complexity
Häftad, Engelska, 2010
Av Israel) Goldreich, Oded (Weizmann Institute of Science, Oded Goldreich
729 kr
Beställningsvara. Skickas inom 7-10 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.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.
Produktinformation
- Utgivningsdatum2010-08-16
- Mått156 x 228 x 13 mm
- Vikt336 g
- SpråkEngelska
- Antal sidor216
- FörlagCambridge University Press
- EAN9780521122542