Fortell venner om denne varen:
Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics Peter Burgisser Softcover reprint of hardcover 1st ed. 2000 edition
Pris
NOK 959
Bestillingsvarer
Forventes levert 12. - 20. 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;
168 pages, biography
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 4. desember 2010 |
| ISBN13 | 9783642086045 |
| Utgivere | Springer-Verlag Berlin and Heidelberg Gm |
| Antall sider | 168 |
| Mål | 155 × 235 × 9 mm · 267 g |
| Språk | Engelsk |