🏢 University of Missouri
Low Degree Hardness for Broadcasting on Trees
·1545 words·8 mins·
loading
·
loading
AI Theory
Optimization
🏢 University of Missouri
Low-degree polynomials fail to efficiently infer roots in broadcasting tree problems below the Kesten-Stigum bound.