Pastāsti draugiem par šo preci:
Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics Peter Burgisser Softcover reprint of hardcover 1st ed. 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;
168 pages, biography
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2010. gada 4. decembris |
| ISBN13 | 9783642086045 |
| Izdevēji | Springer-Verlag Berlin and Heidelberg Gm |
| Lapas | 168 |
| Izmēri | 155 × 235 × 9 mm · 267 g |
| Valoda | Angļu |
Vairāk no Peter Burgisser
Rādīt visuVairāk no tā paša izdevēja
Skatīt visus Peter Burgisser ( piem., Hardcover Book un Paperback Book )