Pages that link to "Item:Q5122161"
From MaRDI portal
The following pages link to HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS (Q5122161):
Displaying 13 items.
- 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)
- Disordered systems insights on computational hardness (Q5055432) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- (Q5253272) (← 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)
- Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics (Q6203476) (← links)
- Subexponential-time algorithms for sparse PCA (Q6566150) (← links)
- The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)
- A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs (Q6641062) (← links)
- Computational and statistical thresholds in multi-layer stochastic block models (Q6656627) (← links)
