no code implementations • 7 Feb 2023 • Asaf Rotenberg, Wasim Huleihel, Ofer Shayevitz
To provide an evidence for this statistical computational gap, we prove computational lower bounds based on the low-degree conjecture, and show that the class of low-degree polynomials algorithms fail in the conjecturally hard region.
