Author:
Anshu Anurag,Boddu Naresh Goud,Touchette Dave
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On parity decision trees for Fourier-sparse Boolean functions;ACM Transactions on Computation Theory;2024-06-10
2. Hardness Condensation by Restriction;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Upper Bounds on Communication in Terms of Approximate Rank;Theory of Computing Systems;2023-12-12
4. Around the log-rank conjecture;Israel Journal of Mathematics;2023-09
5. Upper Bounds on Communication in Terms of Approximate Rank;Computer Science – Theory and Applications;2021