The following pages link to (Q5875785):
Displaying 12 items.
- Bounds on the quality of the PCA bounding boxes (Q1028234) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Optimal low-degree hardness of maximum independent set (Q2113266) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian (Q2235162) (← links)
- Disordered systems insights on computational hardness (Q5055432) (← links)
- Hard Core via PCA: Entropy Bounds (Q5500615) (← links)
- A review on quantum approximate optimization algorithm and its variants (Q6546559) (← links)
- Subexponential-time algorithms for sparse PCA (Q6566150) (← 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)
