Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science - Dieter Van Melkebeek - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540414926 - 2000. gada 13. decembris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

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

Cena
€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 5. - 15. jūn.
Pievienot savam iMusic vēlmju sarakstam

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

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 2000. gada 13. decembris
ISBN13 9783540414926
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 198
Izmēri 156 × 234 × 11 mm   ·   312 g
Valoda Angļu  

Mere med samme udgiver