Sokolov D. Random (log đť‘›)-CNF Are Hard for Cutting Planes (Again). Proceedings of the 56th Annual ACM Symposium on Theory of Computing. (2008-2015).
Banks J, Mohanty S and Raghavendra P. Local statistics, semidefinite programming, and community detection. Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. (1298-1316).
Abascal J, Guruswami V and Kothari P. Strongly refuting all semi-random boolean CSPs. Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. (454-472).
Mohanty S, Raghavendra P and Xu J. Lifting sum-of-squares lower bounds: degree-2 to degree-4. Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. (840-853).
Ananth P, Jain A, Lin H, Matt C and Sahai A. Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification. Advances in Cryptology – CRYPTO 2019. (284-332).
Atserias A and Hakoniemi T. Size-degree trade-offs for sums-of-squares and positivstellensatz proofs. Proceedings of the 34th Computational Complexity Conference. (1-20).
Verdugo V and Verschae J. Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling. Integer Programming and Combinatorial Optimization. (427-441).
Barak B, Hopkins S, Jain A, Kothari P and Sahai A. Sum-of-Squares Meets Program Obfuscation, Revisited. Advances in Cryptology – EUROCRYPT 2019. (226-250).
Raghavendra P, Rao S and Schramm T. Strongly refuting random CSPs below the spectral threshold. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. (121-131).
Chen X. Integrality gaps and approximation algorithms for dispersers and bipartite expanders. Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms. (1543-1560).
Hopkins S, Kothari P, Potechin A, Raghavendra P and Schramm T. On the integrality gap of degree-4 sum of squares for planted clique. Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms. (1079-1095).
Ma T and Wigderson A. Sum-of-squares lower bounds for Sparse PCA. Proceedings of the 29th International Conference on Neural Information Processing Systems - Volume 1. (1612-1620).
Lauria M and Nordström J. Tight size-degree bounds for sums-of-squares proofs. Proceedings of the 30th Conference on Computational Complexity. (448-466).
Barak B, Chan S and Kothari P. Sum of Squares Lower Bounds from Pairwise Independence. Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. (97-106).
Meka R, Potechin A and Wigderson A. Sum-of-squares Lower Bounds for Planted Clique. Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. (87-96).
Lee J, Raghavendra P and Steurer D. Lower Bounds on the Size of Semidefinite Programming Relaxations. Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. (567-576).
Dwork C, Nikolov A and Talwar K. Using Convex Relaxations for Efficiently and Privately Releasing Marginals. Proceedings of the thirtieth annual symposium on Computational geometry. (261-270).
Barak B, Kelner J and Steurer D. Rounding sum-of-squares relaxations. Proceedings of the forty-sixth annual ACM symposium on Theory of computing. (31-40).
Göös M and Pitassi T. Communication lower bounds via critical block sensitivity. Proceedings of the forty-sixth annual ACM symposium on Theory of computing. (847-856).
O'Donnell R, Wright J, Wu C and Zhou Y. Hardness of robust graph isomorphism, lasserre gaps, and asymmetry of random graphs. Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. (1659-1677).
Beck C and Impagliazzo R. Strong ETH holds for regular resolution. Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. (487-494).
O'Donnell R and Zhou Y. Approximability and proof complexity. Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms. (1537-1556).
Pitassi T and Segerlind N. Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms. (355-364).
Kojevnikov A and Itsykson D. Lower bounds of static lovász-schrijver calculus proofs for tseitin tautologies. Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I. (323-334).