Author:
Alekhnovich Mikhail,Arora Sanjeev,Tourlakis Iannis
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
2. Lift-and-Project Methods for Set Cover and Knapsack;Algorithmica;2018-03-28
3. Sum of squares lower bounds for refuting any CSP;Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing;2017-06-19
4. Semidefinite and linear programming integrality gaps for scheduling identical machines;Mathematical Programming;2017-05-10
5. Complexity theoretic limitations on learning halfspaces;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19