Author:
Chattopadhyay Arkadev,Mande Nikhil S.
Publisher
Theory of Computing Exchange
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. The hardest halfspace;computational complexity;2021-08-03
3. On Multiparty Communication with Large versus Unbounded Error;Theory of Computing;2018