Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Roy Armoni, Amnon Ta-Shma, Avi Wigderson, and Shiyu Zhou. SL ⊑ L
4/3. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC), pages 230–239, 1997.
2. Mihir Bellare, Oded Goldreich, and Shafi Goldwasser. Randomness in interactive proofs. Computational Complexity, 3(4):319–354, 1993.
3. Russel Impagliazzo, Noam Nisan, and Avi Wigderson. Pseudorandomness for network algorithms. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC), pages 356–364, Montreal, Québec, Canada, May 1994.
4. Noam Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449–461, June 1992.
5. Noam Nisan and David Zuckerman. More deterministic simulation in logspace. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC), pages 235–244, San Diego, CA, May 1993.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximating Iterated Multiplication of Stochastic Matrices in Small Space;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Near-Optimal Derandomization of Medium-Width Branching Programs;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Pseudorandom generators for combinatorial checkerboards;computational complexity;2012-02-04
4. Derandomization in Combinatorial Optimization;Handbook of Randomized Computing;2001