Randomness and Completeness in Computational Complexity
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...
Κύριος συγγραφέας: | Melkebeek, Dieter van (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2000.
|
Έκδοση: | 1st ed. 2000. |
Σειρά: | Lecture Notes in Computer Science,
1950 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Mathematics of Program Construction 4th International Conference, MPC'98, Marstrand, Sweden, June 15-17, 1998, Proceedings /
Έκδοση: (1998) -
Machines, Computations, and Universality Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings /
Έκδοση: (2001) -
Fundamentals of Computation Theory 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings /
Έκδοση: (2001) -
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings /
Έκδοση: (2002) -
Formal and Natural Computing Essays Dedicated to Grzegorz Rozenberg /
Έκδοση: (2002)