Randomness and Completeness in Computational Complexity

• Main Author: Melkebeek, Dieter van (Author, http://id.loc.gov/vocabulary/relators/aut)
• Corporate Author: SpringerLink (Online service)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Edition: 1st ed. 2000.
• Series: Lecture Notes in Computer Science, 1950
• Subjects: Computer programming.; Computers.; Algorithms.; Computer logic.; Programming Techniques.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Logics and Meanings of Programs.

This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999...