Author:
Ben-David Shalev,Bouland Adam,Garg Ankit,Kothari Robin
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A New Minimax Theorem for Randomized Algorithms;Journal of the ACM;2023-11-30
2. Randomized versus Deterministic Decision Tree Size;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Approximate Degree in Classical and Quantum Computing;Foundations and Trends® in Theoretical Computer Science;2022
4. Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. Lower Bounding the AND-OR Tree via Symmetrization;ACM Transactions on Computation Theory;2021-03