Tell your friends about this item:
P, NP, and NP-Completeness: The Basics of Computational Complexity Goldreich, Oded (Weizmann Institute of Science, Israel)
Price
Íkr 17,939
excl. VAT
Ordered from remote warehouse
Expected delivery Aug 14 - 21
Get notified about new Goldreich, Oded (Weizmann Institute of Science, Israel) releases
Our customers say:
Add to your iMusic wish list
P, NP, and NP-Completeness: The Basics of Computational Complexity
Goldreich, Oded (Weizmann Institute of Science, Israel)
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.
214 pages, 18 b/w illus. 94 exercises
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | August 16, 2010 |
| ISBN13 | 9780521192484 |
| Publishers | Cambridge University Press |
| Pages | 216 |
| Dimensions | 236 × 161 × 20 mm · 462 g |
| Language | English |
