Fortell venner om denne varen:
Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics Peter Burgisser 2000 edition
Pris
NOK 1.149
Bestillingsvarer
Forventes levert 5. - 19. nov
Julegaver kan byttes frem til 31. januar
Få varsel om nye utgivelser fra Peter Burgisser
Legg til iMusic ønskeliste
eller
Finnes også som:
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
| Media | Bøker Innbunden bok (Bok med hard rygg og stivt omslag) |
| Utgitt | 21. juni 2000 |
| ISBN13 | 9783540667520 |
| Utgivere | Springer-Verlag Berlin and Heidelberg Gm |
| Antall sider | 168 |
| Mål | 165 × 244 × 12 mm · 435 g |
| Språk | Fransk |