Affiliation:
1. University of California at Los Angeles, USA
Funder
National Science Foundation
Alfred P. Sloan Foundation
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Super Non-singular Decompositions of Polynomials and Their Application to Robustly Learning Low-Degree PTFs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. 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
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. Approximate Degree in Classical and Quantum Computing;Foundations and Trends® in Theoretical Computer Science;2022
5. Sign-rank Can Increase under Intersection;ACM Transactions on Computation Theory;2021-12-31