Recomienda este artículo a tus amigos:
Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics Peter Burgisser 2000 edition
Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics
Peter Burgisser
This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's algebraic theory of NP-completeness; interrelations with the classical theory as well as the Blum-Shub-Smale model of computation, questions of structural complexity;
186 pages, biography
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 21 de junio de 2000 |
| ISBN13 | 9783540667520 |
| Editores | Springer-Verlag Berlin and Heidelberg Gm |
| Páginas | 168 |
| Dimensiones | 165 × 244 × 12 mm · 435 g |
| Lengua | Francés |
Mas por Peter Burgisser
Mostrar todoMere med samme udgiver
Ver todo de Peter Burgisser ( Ej. Hardcover Book y Paperback Book )