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.
Product Identifiers
Publisher
Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
ISBN-13
9783540414926
eBay Product ID (ePID)
95007419
Product Key Features
Author
Dieter Van Melkebeek
Publication Name
Randomness and Completeness in Computational Complexity
Format
Paperback
Language
English
Subject
Computer Science
Publication Year
2000
Type
Textbook
Number of Pages
198 Pages
Dimensions
Item Height
235mm
Item Width
155mm
Volume
1950
Item Weight
700g
Additional Product Features
Title_Author
Dieter Van Melkebeek
Series Title
Lecture Notes in Computer Science
Country/Region of Manufacture
Germany
Best Selling in Adult Learning & University
Current slide {CURRENT_SLIDE} of {TOTAL_SLIDES}- Best Selling in Adult Learning & University