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
AbstractWe show the existence of nonuniform schemes for the following sampling problem: Given a samp...
This dissertation explores the multifaceted interplay between efficient computation and probability ...
We present a simple new construction of a pseudorandom bit generator, based on the constant depth ge...
AbstractWe show that any randomized algorithm that runs in spaceSand timeTand uses poly(S) random bi...
Suppose a language L can be decided by a bounded-error randomized algorithm that runs in space S and...
Borodin, Cook, and Pippenger (Inform. and Control 58 (1983), 96–114) proved that both probabilistic ...
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...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
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...
To what extent is randomness necessary for efficient computation? We study the problem of determinis...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
Probabilistic methods have become an integral part of theoretical computer science. Typically, the u...
AbstractIn contrast to deterministic or nondeterministic computation, it is a fundamental open probl...
AbstractWe show the existence of nonuniform schemes for the following sampling problem: Given a samp...
This dissertation explores the multifaceted interplay between efficient computation and probability ...
We present a simple new construction of a pseudorandom bit generator, based on the constant depth ge...
AbstractWe show that any randomized algorithm that runs in spaceSand timeTand uses poly(S) random bi...
Suppose a language L can be decided by a bounded-error randomized algorithm that runs in space S and...
Borodin, Cook, and Pippenger (Inform. and Control 58 (1983), 96–114) proved that both probabilistic ...
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...
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of...
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...
To what extent is randomness necessary for efficient computation? We study the problem of determinis...
Random number generators are widely used in practical algorithms. Examples include simulation, numbe...
Probabilistic methods have become an integral part of theoretical computer science. Typically, the u...
AbstractIn contrast to deterministic or nondeterministic computation, it is a fundamental open probl...
AbstractWe show the existence of nonuniform schemes for the following sampling problem: Given a samp...
This dissertation explores the multifaceted interplay between efficient computation and probability ...
We present a simple new construction of a pseudorandom bit generator, based on the constant depth ge...
DOI
Add to ORKG