Randomized algorithms
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Deterministic Amplification of Space-Bounded Probabilistic Algorithms
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Uniform Circuits for Division: Consequences and Problems
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Two theorems on random polynomial time
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Dispersers, deterministic amplification, and weak random sources
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Randomness-Efficient Sampling within NC1
Computational Complexity
Randomness-efficient sampling within NC1
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |
We show that RL ⊆ L/O(n), i.e., any language computable in randomized logarithmic space can be computed in deterministic logarithmic space with a linear amount of non-uniform advice. To prove our result we use an ultra-low space walk on the Gabber-Galil expander graph due to Gutfreund and Viola.