Author:
Buhrman Harry,Vereshchagin Nikolay,de Wolf Ronald
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes;ACM SIGACT News;2024-03-26
2. Depth- Threshold Circuits vs. Depth-(+1) AND-OR Trees;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. The approximate degree of DNF and CNF formulas;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
4. A Short List of Equalities Induces Large Sign-Rank;SIAM Journal on Computing;2022-06
5. Approximate Degree in Classical and Quantum Computing;Foundations and Trends® in Theoretical Computer Science;2022