Author:
Austrin Per,Guruswami Venkatesan,Håstad Johan
Funder
Swedish Research Council
Packard Fellowship
H2020 European Research Council
National Science Foundation
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Optimal Inapproximability with Universal Factor Graphs;ACM Transactions on Algorithms;2023-12-15
2. Boolean symmetric vs. functional PCSP dichotomy;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Approximate Graph Colouring and the Hollow Shadow;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. SDPs and Robust Satisfiability of Promise CSP;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs;Algorithmica;2023-03-27