AbstractWe show that any randomized algorithm that runs in spaceSand timeTand uses poly(S) random bits can be simulated using onlyO(S) random bits in spaceSand timeT+poly(S). A deterministic simulation in spaceSfollows. Of independent interest is our main technical tool: a procedure which extracts randomness from a defective random source using a small additional number of truly random bits
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
AbstractThe algorithmic theory of randomness is well developed when the underlying space is the set ...
Randomness is a crucial component in the design and analysis of many efficient algorithms. This thes...
AbstractWe show that any randomized algorithm that runs in spaceSand timeTand uses poly(S) random bi...
Borodin, Cook, and Pippenger (Inform. and Control 58 (1983), 96–114) proved that both probabilistic ...
Suppose a language L can be decided by a bounded-error randomized algorithm that runs in space S and...
Parallel time and space are perhaps the two most fundamental resources in computation. They appear t...
We prove there is no polynomial deterministic space simulation for two-way random-tape probabilistic...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
This paper initiates the study of deterministic ampli-fication of space-bounded probabilistic algori...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
AbstractWe prove that any language that can be recognized by a randomized algorithm (with possibly a...
Probabilistic methods have become an integral part of theoretical computer science. Typically, the u...
We give various characterizations for algorithmically random con®gurations on full shift spaces, bas...
The study of Martin-Lof randomness on a computable metric space with a computable measure has had mu...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
AbstractThe algorithmic theory of randomness is well developed when the underlying space is the set ...
Randomness is a crucial component in the design and analysis of many efficient algorithms. This thes...
AbstractWe show that any randomized algorithm that runs in spaceSand timeTand uses poly(S) random bi...
Borodin, Cook, and Pippenger (Inform. and Control 58 (1983), 96–114) proved that both probabilistic ...
Suppose a language L can be decided by a bounded-error randomized algorithm that runs in space S and...
Parallel time and space are perhaps the two most fundamental resources in computation. They appear t...
We prove there is no polynomial deterministic space simulation for two-way random-tape probabilistic...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
This paper initiates the study of deterministic ampli-fication of space-bounded probabilistic algori...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
AbstractWe prove that any language that can be recognized by a randomized algorithm (with possibly a...
Probabilistic methods have become an integral part of theoretical computer science. Typically, the u...
We give various characterizations for algorithmically random con®gurations on full shift spaces, bas...
The study of Martin-Lof randomness on a computable metric space with a computable measure has had mu...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
AbstractThe algorithmic theory of randomness is well developed when the underlying space is the set ...
Randomness is a crucial component in the design and analysis of many efficient algorithms. This thes...
DOI
Add to ORKG