Author:
Barak Boaz,Kindler Guy,Steurer David
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sum of squares lower bounds for refuting any CSP;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19
2. Strongly refuting random CSPs below the spectral threshold;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19
3. Complexity theoretic limitations on learning halfspaces;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19
4. Algebraic attacks against random local functions and their countermeasures;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19
5. Cryptographic Hardness of Random Local Functions;computational complexity;2015-12-22