Theoretical computer science · Oct 6, 2026
Average sensitivity of polynomial threshold functions
Proves that a degree-at-most-d polynomial threshold function on the uniform n-dimensional Boolean cube has average sensitivity at most , uniformly for . Average sensitivity counts expected output changes under single-bit flips. This establishes the asymptotic Gotsman–Linial conjecture, allowing polynomial zeros with .
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model