Notes on Computational Hardness of Hypothesis Testing: Predictions Using the Low-Degree Likelihood Ratio
- 3 February 2022
- book chapter
- Published by Springer Nature
- p. 1-50
Abstract
No abstract availableKeywords
All Related Versions
This publication has 53 references indexed in Scilit:
- Random Matrices and Complexity of Spin GlassesCommunications on Pure and Applied Mathematics, 2012
- The eigenvalues and eigenvectors of finite, low rank perturbations of large random matricesAdvances in Mathematics, 2011
- Message-passing algorithms for compressed sensingProceedings of the National Academy of Sciences, 2009
- On Consistency and Sparsity for Principal Components Analysis in High DimensionsJournal of the American Statistical Association, 2009
- Gibbs states and the set of solutions of random constraint satisfaction problemsProceedings of the National Academy of Sciences, 2007
- Phase transition of the largest eigenvalue for nonnull complex sample covariance matricesThe Annals of Probability, 2005
- Noise-tolerant learning, the parity problem, and the statistical query modelJournal of the ACM, 2003
- Heuristics for Semirandom Graph ProblemsJournal of Computer and System Sciences, 2001
- Expected complexity of graph partitioning problemsDiscrete Applied Mathematics, 1995
- Almost all cubic graphs are HamiltonianRandom Structures & Algorithms, 1992