Recomienda este artículo a tus amigos:
Computational Complexity Christos Papadimitriou
Computational Complexity
Christos Papadimitriou
Offers a comprehensive treatment of the theory of algorithms and complexity. Among topics covered are: reductions and NP - completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, and more.
500 pages, notes, references
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 30 de noviembre de 1993 |
| Fecha de lanzamiento original | 1994 |
| ISBN13 | 9780201530827 |
| Editores | Pearson Education (US) |
| Páginas | 544 |
| Dimensiones | 171 × 246 × 30 mm · 802 g |
Mas por Christos Papadimitriou
Mostrar todoMere med samme udgiver
Ver todo de Christos Papadimitriou ( Ej. Paperback Book )