Melkebeek, Dieter van <br/><br/>
Randomness and completeness in computational complexity 
Dieter van Melkebeek 
 - Berlin  Springer-Verlag  c2000 
 - xv, 196 p. : ill. ; 24 cm 
<br/><br/> Revision of thesis (Ph.D)--University of Chicago, 1999. Includes bibliographical references (p. [183]-189) and indexes 
<br/><br/><label>ISBN: </label>9783540414926 
<br/><br/><label>ISSN: </label>69239 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computational complexity<br/>Computer science - Mathematics
<br/><br/><label>Dewey Class. No.: </label>004.0151 MEL