Randomness and completeness in computational complexity
By: Dieter van Melkebeek.
Series: Lecture notes in computer science -- 1950.
Publisher: Springer-Verlag; Springer
Published: 2000
Place of publication: New York
Language: eng
Number of pages: 196
Subjects: Computer science -- Mathematics; Computational complexity
Notes: Revision of thesis (Ph. D.)--University of Chicago, 1999.

Includes bibliographical references.