Randomness and completeness in computational complexity
Auteur :
Melkebeek, Dieter van
Éditeur :
Melkebeek, Dieter van
ISBN :
9783540414926
Date de publication :
13 déc. 2000
Dimensions :
23,4 x 15,6 x 1,1 cm
Poids :
316 g
Format :
Trade paperback (US)
Langue :
Anglais
Pays d'origine :
Allemagne
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.