Pages that link to "Item:Q4640281"
From MaRDI portal
The following pages link to Statistical Algorithms and a Lower Bound for Detecting Planted Cliques (Q4640281):
Displaying 17 items.
- The overlap gap property in principal submatrix recovery (Q2067659) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Exact recovery in the hypergraph stochastic block model: a spectral algorithm (Q2310389) (← links)
- Estimation of Wasserstein distances in the spiked transport model (Q2676937) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- (Q4999009) (← links)
- (Q5075740) (← links)
- Finding a planted clique by adaptive probing (Q5126325) (← links)
- Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
- Polynomial‐time universality and limitations of deep learning (Q6074573) (← links)
- Adversarial manifold estimation (Q6118078) (← links)
- Algorithmic obstructions in the random number partitioning problem (Q6139686) (← links)
- Statistical-computational trade-offs in tensor PCA and related problems via communication complexity (Q6151966) (← links)
- The landscape of the planted clique problem: dense subgraphs and the overlap gap property (Q6616866) (← links)
- Computational lower bounds for graphon estimation via low-degree polynomials (Q6656622) (← links)
