Conte aos seus amigos sobre este item:
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
| Mídia | Livros Hardcover Book (Livro com lombada e capa dura) |
| Lançado | 21 de junho de 2000 |
| ISBN13 | 9783540667520 |
| Editoras | Springer-Verlag Berlin and Heidelberg Gm |
| Páginas | 168 |
| Dimensões | 165 × 244 × 12 mm · 435 g |
| Idioma | Francês |
Mais por Peter Burgisser
Ver tudo de Peter Burgisser ( por exemplo Hardcover Book e Paperback Book )
Presentes de Natal podem ser trocados até 31 de janeiro