Randomness and Completeness in Computational Complexity

Shelfclass_id 3.D.4
Sortkey VAN MELKEBEEK, DIETER
Authors Dieter van Melkebeek
Title Randomness and Completeness in Computational Complexity
Publisher Springer
Year 2000
Languages eng
Isbn 3540414924, 9783540414926
Series Lecture Notes in Computer Science
Volume 1950
Issn 0302-9743
Description xv, 196 p. ill. 24 cm
Record date 20110325
Location New York
Keywords Computer science, Mathematics, Computational complexity
Notes Revision of thesis (Ph.D)--University of Chicago, 1999.
Urlnote Publisher description
Urls http://www.loc.gov/catdir/enhancements/fy0816/00069239-d.html