P, NP, and NP-Completeness
Oded (Weizmann Institute of Science, Israel) Goldreich
Cambridge University Press, 2010
72,75 €On orderDelivery: 2-3 weeks
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.
- ISBN-13
- 9780521122542
- ISBN-10
- 0521122546
- Publisher
- Cambridge University Press
- Year
- 2010
- Publication date
- 2010-08-16
- Pages
- 216
- Dimensions
- 228x156x13
- Weight
- 336