Pastāsti draugiem par šo preci:
P, NP, and NP-Completeness: The Basics of Computational Complexity Goldreich, Oded (Weizmann Institute of Science, Israel)
Cena
€ 71,99
Pasūtīts no attālās noliktavas
Paredzamā piegāde . gada 11. - 19. nov.
Ziemassvētku dāvanas var atgriezt līdz 31. janvārim
Saņemiet paziņojumus par jauniem Goldreich, Oded (Weizmann Institute of Science, Israel) izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
Pieejams arī kā:
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.
216 pages, 18 b/w illus. 94 exercises
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2010. gada 16. augusts |
| ISBN13 | 9780521122542 |
| Izdevēji | Cambridge University Press |
| Lapas | 216 |
| Izmēri | 156 × 228 × 13 mm · 336 g |
| Valoda | Angļu |
