Randomization and Derandomization in Space-Bounded Computation (1996)
by
Michael Saks
| Venue: | In Proceedings of the 11th Annual IEEE Conference on Computational Complexity |
| Citations: | 31 - 0 self |
BibTeX
@INPROCEEDINGS{Saks96randomizationand,
author = {Michael Saks},
title = {Randomization and Derandomization in Space-Bounded Computation},
booktitle = {In Proceedings of the 11th Annual IEEE Conference on Computational Complexity},
year = {1996},
pages = {128--149},
publisher = {IEEE Computer Society}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This is a survey of space-bounded probabilistic computation, summarizing the present state of knowledge about the relationships between the various complexity classes associated with such computation. The survey especially emphasizes recent progress in the construction of pseudorandom generators that fool probabilistic space-bounded computations, and the application of such generators to obtain deterministic simulations.
