Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference35 articles.
1. Alexander E. Andreev (1987). On a Method for Obtaining more than Quadratic Effective Lower Bounds for the Complexity of π-Schemes. Moscow University Mathematics Bulletin 42(1), 24–29.
2. Boaz Barak, Mark Braverman, Xi Chen & Anup Rao (2010). How to compress interactive communication. In STOC, 67–76.
3. Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz & Enav Weinreb (2014). Choosing, Agreeing, and Eliminating in Communication Complexity. Computational Complexity 23(1), 1–42.
4. Maria Luisa Bonet & Samuel R. Buss (1994). Size-Depth Tradeoffs for Boolean Formulae. Inf. Process. Lett. 49(3), 151–155.
5. Mark Braverman (2012). Interactive information complexity. In STOC, 505–524.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. KRW Composition Theorems via Lifting;computational complexity;2024-04-29
2. Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Top-Down Lower Bounds for Depth-Four Circuits;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Capturing One-Way Functions via NP-Hardness of Meta-Complexity;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC°;Theory of Computing;2023