Pastāsti draugiem par šo preci:
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
| Mediji | Grāmatas Hardcover Book (Grāmata ar cieto muguriņu un vāku) |
| Izlaists | 2000. gada 21. jūnijs |
| ISBN13 | 9783540667520 |
| Izdevēji | Springer-Verlag Berlin and Heidelberg Gm |
| Lapas | 168 |
| Izmēri | 165 × 244 × 12 mm · 435 g |
| Valoda | Franč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 )