A characterization of approximation resistance for even k-partite CSPs
Author:
Austrin Per,Khot Subhash
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the approximation resistance of balanced linear threshold functions;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23
2. Complexity and Approximability of Parameterized MAX-CSPs;Algorithmica;2017-04-19
3. A characterization of strong approximation resistance;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31
4. The Complexity of Somewhat Approximation Resistant Predicates;Automata, Languages, and Programming;2014