Randomness and Completeness in Computational Complexity by Dieter van Melkebeek.

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...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsman: Melkebeek, Dieter van (Författare, medförfattare)
Institutionell upphovsman: SpringerLink (Online service)
Materialtyp: E-bok
Språk:English
Publicerad: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
Upplaga:1st ed. 2000.
Serie:Lecture Notes in Computer Science, 1950
Springer eBook Collection.
Ämnen:
Länkar:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

Liknande verk