Fortell venner om denne varen:
Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science 2000 edition
Dieter Van Melkebeek
Pris
SEK 529
Bestillingsvarer
Forventes levert 3. - 11. jul
Legg til iMusic ønskeliste
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
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 13. desember 2000 |
| ISBN13 | 9783540414926 |
| Utgivere | Springer-Verlag Berlin and Heidelberg Gm |
| Antall sider | 198 |
| Mål | 156 × 234 × 11 mm · 312 g |
| Språk | Engelsk |
