Recomienda este artículo a tus amigos:
P, NP, and NP-Completeness: The Basics of Computational Complexity Goldreich, Oded (Weizmann Institute of Science, Israel)
Precio
$ 145,99
sin IVA
Pedido desde almacén remoto
Entrega prevista 3 - 15 de sep.
Recibe notificaciones sobre nuevos lanzamientos de Goldreich, Oded (Weizmann Institute of Science, Israel)
Nuestros clientes opinan:
Añadir a tu lista de deseos de iMusic
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
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 16 de agosto de 2010 |
| ISBN13 | 9780521192484 |
| Editores | Cambridge University Press |
| Páginas | 216 |
| Dimensiones | 236 × 161 × 20 mm · 462 g |
| Lengua | Inglés |
