Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

23 February 2015

Papers citing "Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems"

12 / 12 papers shown

Title
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms Raffaele Marino L. Buffoni Bogdan Zavalnij GNN 40 5 0 13 Mar 2024
Concentration of polynomial random matrices via Efron-Stein inequalities Goutham Rajendran Madhur Tulsiani 14 7 0 06 Sep 2022
Robust Estimation for Random Graphs Jayadev Acharya Ayush Jain Gautam Kamath A. Suresh Huanyu Zhang 30 8 0 09 Nov 2021
Inferring Hidden Structures in Random Graphs Wasim Huleihel 19 7 0 05 Oct 2021
Algorithmic Obstructions in the Random Number Partitioning Problem D. Gamarnik Eren C. Kizildaug 21 21 0 02 Mar 2021
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent Matthew Brennan Guy Bresler Samuel B. Hopkins Jingkai Li T. Schramm 19 62 0 13 Sep 2020
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection Yuetian Luo Anru R. Zhang 27 14 0 12 Sep 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 35 44 0 21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 29 86 0 16 May 2020
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 29 136 0 26 Jul 2019
Subexponential-Time Algorithms for Sparse PCA Yunzi Ding Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 30 57 0 26 Jul 2019
Computational Hardness of Certifying Bounds on Constrained PCA Problems Afonso S. Bandeira Dmitriy Kunisky Alexander S. Wein 20 64 0 19 Feb 2019