Pages that link to "Item:Q2103494"
From MaRDI portal
The following pages link to Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494):
Displaying 9 items.
- Free Energy Wells and Overlap Gap Property in Sparse PCA (Q6074556) (← 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)
- Optimal estimation and computational limit of low-rank Gaussian mixtures (Q6172192) (← links)
- Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio (Q6322739) (← links)
- Public-key encryption, local pseudorandom generators, and the low-degree method (Q6581791) (← links)
- Matrix denoising: Bayes-optimal estimators via low-degree polynomials (Q6635291) (← links)
- Computational lower bounds for graphon estimation via low-degree polynomials (Q6656622) (← links)
- Computational and statistical thresholds in multi-layer stochastic block models (Q6656627) (← links)
