Fortæl dine venner om denne vare:
Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science 2000 edition
Dieter Van Melkebeek
Pris
SEK 659
Bestilles fra fjernlager
Forventes klar til forsendelse 3. - 9. jul.
Tilføj til din iMusic ønskeseddel
Eller
Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science 2000 edition
Dieter Van Melkebeek
This text, based on the author's competition-winning PhD thesis, studies central issues in computational complexity: the relative power of time, space, and randomness in computing and verification. He presents approaches based on such concepts as density, redundancy, and frequency of occurrence.
198 pages, biography
| Medie | Bøger Paperback Bog (Bog med blødt omslag og limet ryg) |
| Udgivet | 13. december 2000 |
| ISBN13 | 9783540414926 |
| Forlag | Springer-Verlag Berlin and Heidelberg Gm |
| Antal sider | 198 |
| Mål | 156 × 234 × 11 mm · 312 g |
| Sprog | Engelsk |
