Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science - Dieter Van Melkebeek - Knihy - Springer-Verlag Berlin and Heidelberg Gm - 9783540414926 - 13. decembra 2000
V prípade, že obal a názov nesedia, platí názov

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

Cena
€ 52,99

Objednané zo vzdialeného skladu

Očakávané doručenie 17. - 25. jún
Pridať do vášho zoznamu prianí na 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

Médium Knihy     Paperback Book   (Kniha s mäkkou väzbou a lepeným chrbtom)
Vydané 13. decembra 2000
ISBN13 9783540414926
Vydavatelia Springer-Verlag Berlin and Heidelberg Gm
Strany 198
Rozmery 156 × 234 × 11 mm   ·   312 g
Jazyk Angličtina  

Mere med samme udgiver