Author:
Santhanam Rahul,Williams Ryan
Cited by
18 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. On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds;Journal of the ACM;2023-04-20
3. On the Range Avoidance Problem for Circuits;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
5. Fooling Constant-Depth Threshold Circuits (Extended Abstract);2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02