planted clique

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares COLT 2026 Low-degree phase transitions for detecting a planted clique in sublinear time COLT 2024 Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique COLT 2023 Is Planted Coloring Easier than Planted Clique? COLT 2023 Sparse PCA Beyond Covariance Thresholding COLT 2023 Average-Case Communication Complexity of Statistical Problems COLT 2021 Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent COLT 2021 Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection COLT 2020 Reducibility and Statistical-Computational Gaps from Secret Leakage COLT 2020 Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness COLT 2019 Universality of Computational Lower Bounds for Submatrix Detection COLT 2019 Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure COLT 2018 The Hidden Hubs Problem COLT 2017 Computational Lower Bounds for Community Detection on Random Graphs COLT 2015 Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems COLT 2015 Label optimal regret bounds for online local learning COLT 2015 Complexity Theoretic Lower Bounds for Sparse Principal Component Detection COLT 2013 The Lovász ϑ function, SVMs and finding large dense subgraphs NeurIPS 2012