Author:
Austrin Per,Mossel Elchanan
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. How Random CSPs Fool Hierarchies;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Sketching Approximability of All Finite CSPs;Journal of the ACM;2024-04-12
3. Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. On approximability of satisfiable
k
-CSPs: I;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. Approximability of all finite CSPs with linear sketches;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02