ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1904.07174
  4. Cited By
The Landscape of the Planted Clique Problem: Dense subgraphs and the
  Overlap Gap Property
v1v2 (latest)

The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property

15 April 2019
D. Gamarnik
Ilias Zadik
ArXiv (abs)PDFHTML

Papers citing "The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property"

17 / 17 papers shown
Title
Densest Subgraphs of a Dense Erdös-Rényi Graph. Asymptotics,
  Landscape and Universality
Densest Subgraphs of a Dense Erdös-Rényi Graph. Asymptotics, Landscape and Universality
Houssam El Cheairi
D. Gamarnik
34
3
0
07 Dec 2022
Average-Case Complexity of Tensor Decomposition for Low-Degree
  Polynomials
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials
Alexander S. Wein
110
11
0
10 Nov 2022
On free energy barriers in Gaussian priors and failure of cold start
  MCMC for high-dimensional unimodal distributions
On free energy barriers in Gaussian priors and failure of cold start MCMC for high-dimensional unimodal distributions
Afonso S. Bandeira
Antoine Maillard
Richard Nickl
Sven Wang
83
10
0
05 Sep 2022
The Franz-Parisi Criterion and Computational Trade-offs in High
  Dimensional Statistics
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics
Afonso S. Bandeira
A. Alaoui
Samuel B. Hopkins
T. Schramm
Alexander S. Wein
Ilias Zadik
93
34
0
19 May 2022
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using
  Graph-based Machine Learning
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning
Itay Levinas
Y. Louzoun
65
2
0
05 Jan 2022
On the Cryptographic Hardness of Learning Single Periodic Neurons
On the Cryptographic Hardness of Learning Single Periodic Neurons
M. Song
Ilias Zadik
Joan Bruna
AAML
58
28
0
20 Jun 2021
The Algorithmic Phase Transition of Random $k$-SAT for Low Degree
  Polynomials
The Algorithmic Phase Transition of Random kkk-SAT for Low Degree Polynomials
Guy Bresler
Brice Huang
77
47
0
03 Jun 2021
Algorithmic Obstructions in the Random Number Partitioning Problem
Algorithmic Obstructions in the Random Number Partitioning Problem
D. Gamarnik
Eren C. Kizildaug
74
23
0
02 Mar 2021
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Matthew Brennan
Guy Bresler
Samuel B. Hopkins
Jingkai Li
T. Schramm
84
66
0
13 Sep 2020
Computational Barriers to Estimation from Low-Degree Polynomials
Computational Barriers to Estimation from Low-Degree Polynomials
T. Schramm
Alexander S. Wein
70
67
0
05 Aug 2020
Solving Random Parity Games in Polynomial Time
Solving Random Parity Games in Polynomial Time
Richard Combes
M. Touati
LRM
20
0
0
16 Jul 2020
Free Energy Wells and Overlap Gap Property in Sparse PCA
Free Energy Wells and Overlap Gap Property in Sparse PCA
Gerard Ben Arous
Alexander S. Wein
Ilias Zadik
65
34
0
18 Jun 2020
Tensor Clustering with Planted Structures: Statistical Optimality and
  Computational Limits
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits
Yuetian Luo
Anru R. Zhang
134
46
0
21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage
Reducibility and Statistical-Computational Gaps from Secret Leakage
Matthew Brennan
Guy Bresler
99
91
0
16 May 2020
The Overlap Gap Property in Principal Submatrix Recovery
The Overlap Gap Property in Principal Submatrix Recovery
D. Gamarnik
Aukosh Jagannath
S. Sen
62
29
0
26 Aug 2019
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust
  Estimation and Semirandom Adversaries
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries
Matthew Brennan
Guy Bresler
133
12
0
08 Aug 2019
Notes on Computational Hardness of Hypothesis Testing: Predictions using
  the Low-Degree Likelihood Ratio
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio
Dmitriy Kunisky
Alexander S. Wein
Afonso S. Bandeira
99
148
0
26 Jul 2019
1