On the Derandomization of Space-Bounded Computations

Authors:
Roy Armoni
Affiliations:
-
Venue:
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Year:
1998

Citing 6
Cited 1

More deterministic simulation in logspace

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Pseudorandomness for network algorithms

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomness in interactive proofs

Computational Complexity
Randomness-optimal sampling, extractors, and constructive leader election

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SL ⊆L4/3

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
RSPACE(S) " DSPACE(S^3/2)

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Pseudorandom generators for combinatorial checkerboards

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

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-Ɛ 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 O(S√(log R)= log S) which is better than the derandomization of [6].