Pages that link to "Item:Q2149001"
From MaRDI portal
The following pages link to Computational barriers to estimation from low-degree polynomials (Q2149001):
Displaying 7 items.
- 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)
- Computational Barriers to Estimation from Low-Degree Polynomials (Q6346564) (← links)
- Matrix denoising: Bayes-optimal estimators via low-degree polynomials (Q6635291) (← links)
- Pair-matching: link prediction with adaptive queries (Q6652703) (← 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)