Author:
Buhrman Harry,Vereshchagin Nikolay,de Wolf Ronald
Cited by
68 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Depth- Threshold Circuits vs. Depth-(+1) AND-OR Trees;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. The approximate degree of DNF and CNF formulas;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. Sign-Rank vs. Discrepancy;Theory of Computing;2022
4. Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$;SIAM Journal on Computing;2021-08-20
5. The hardest halfspace;computational complexity;2021-08-03