Randomness and Completeness in Computational Complexity

Dieter van Melkebeek. Randomness and Completeness in Computational Complexity. Volume 1950 of Lecture Notes in Computer Science, Springer, 2000.

Abstract

Abstract is missing.