Lifting sum-of-squares lower bounds: degree-2 to degree-4

DOI10.1145/3357713.3384319OpenAlexW3034256405MaRDI QIDQ5144970

Jeff Xu, Sidhanth Mohanty, Prasad Raghavendra

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

random matricesSherrington-Kirkpatrick modelmax cut on random \(d\)-regular graphsum-of-squares lower bounds

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

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 ⋮ Optimization of mean-field spin glasses

This page was built for publication: Lifting sum-of-squares lower bounds: degree-2 to degree-4