Randomness and Completeness in Computational Complexity

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 description

Saved in:
Bibliographic Details
Main Author: Melkebeek, Dieter van (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
Edition:1st ed. 2000.
Series:Lecture Notes in Computer Science, 1950
Springer eBook Collection.
Subjects:
Computer programming.
Computers.
Algorithms.
Computer logic.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Login for hold information

‌

Click to view e-book

Online

Holdings details from Online
Call Number: E-Book
Copy 1 Available

Similar Items