scientific article; zbMATH DE number 7650426

DOI10.4230/LIPIcs.ITCS.2020.78MaRDI QIDQ5875785

Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1902.07324

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Sherrington-Kirkpatrick modelcertificationlow-degree likelihood ratiospiked Wishart model

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Tensor clustering with planted structures: statistical optimality and computational limits ⋮ Disordered systems insights on computational hardness ⋮ Computational barriers to estimation from low-degree polynomials ⋮ A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian ⋮ Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio ⋮ Optimal low-degree hardness of maximum independent set