Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference18 articles.
1. R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, C. Rackoff, Random walks, universal sequences and the complexity of maze problems, 20th IEEE Symposium on Foundations of Computer Science, 1979, 218, 223
2. M. Ajtai, J. Komlós, E. Szemerédi, Deterministic simulation of logspace, Proc. 19th ACM Symposium on Theory of Computing, 1987, 132, 140
3. E. Allender, M. Ogihara, Relationships amongPL#L, Proc. 9th Conference on Structure in Complexity Theory, 1994, 267, 279
4. L. Babai, N. Nisan, M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences, Proc. 21st ACM Symposium on Theory of Computing, 1989
5. Parallel computation and well-endowed rings and space-bounded probabilistic machines;Borodin;Inform. and Control,1983
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Paradigms for Unconditional Pseudorandom Generators;Foundations and Trends® in Theoretical Computer Science;2024
3. Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Certified Hardness vs. Randomness for Log-Space;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. Singular Value Approximation and Sparsifying Random Walks on Directed Graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06