Randomness and Completeness in Computational Complexity
Dieter van Melkebeek "Randomness and Completeness in Computational Complexity "
Springer | 2001-01-25 | ISBN: 3540414924 | 196 pages | PDF | 2,1 Mb
Springer | 2001-01-25 | ISBN: 3540414924 | 196 pages | PDF | 2,1 Mb
This book is based on the author's Ph.D. thesis which was selected as the winning thesis of the 1999 ACM Doctoral Dissertation Competition. Dieter van Melkebeek did his Ph.D. work at the University of Chicago with Lance Fortnow as thesis advisor. This work studies some central issues in computational complexity: the relative power of time, space, and randomness in computing and verification. The author develops techniques for separating complexity classes by isolating structural differences between their complete problems. He presents several approaches based on such diverse concepts as density, redundancy, and frequency of occurrence.