Affiliation:
1. NYU
2. Toyota Technological Institute at Chicago
Funder
Division of Computing and Communication Foundations
BSF
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sketching Approximability of All Finite CSPs;Journal of the ACM;2024-04-12
2. Testing thresholds for high-dimensional sparse random geometric graphs;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. Approximability of all finite CSPs with linear sketches;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. UG-hardness to NP-hardness by Losing Half;Theory of Computing;2022
5. Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs;SIAM Journal on Computing;2019-01