Abstract
We construct a pseudo-random generator for space bounded computations using the extractor of Zuckerman [7]. For machines that use S space and R≤2S1-e random bits for ϵ> 0, the generator uses a seed of length O((S log R)/ log S) which is shorter than the seed of both the generator of Nisan [4] and the generator of Nisan and Zuckerman [5]. We then use this generator to derandomize these machines in space (Formula presented) which is better than the derandomization of [6].
Cite
CITATION STYLE
Armoni, R. (1998). On the derandomization of space-bounded computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1518, pp. 47–59). Springer Verlag. https://doi.org/10.1007/3-540-49543-6_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
