Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science - Dieter Van Melkebeek - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783540414926 - 13. decembra 2000
Če se naslovnica in naslov ne ujemata, je naslov pravilen

Dieter Van Melkebeek
Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science 2000 edition

Cena
€ 50,49

Naročeno iz oddaljenega skladišča

Predvidena dobava 11. - 19. jun

Kaj pravijo naše stranke:

14-dnevna politika vračila v skladu z evropsko zakonodajo o varstvu potrošnikov
Najvišja ocena na Trustpilot
Dodaj na svoj seznam želja iMusic

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

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 13. decembra 2000
ISBN13 9783540414926
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 198
Dimenzije 156 × 234 × 11 mm   ·   312 g
Jezik Angleščina  

Mere med samme udgiver

Ogled vseh Dieter Van Melkebeek ( Na primer Paperback Book )