Author:
Austrin Per,Mossel Elchanan
Cited by
21 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. Sum of squares lower bounds for refuting any CSP;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19
3. A Characterization of Hard-to-cover CSPs;LEIBNIZ INT PR INFOR;2015
4. A characterization of strong approximation resistance;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31
5. Explicit Optimal Hardness via Gaussian Stability Results;ACM Transactions on Computation Theory;2013-11