Abstract
In 1991, Craig Gotsman and Nathan Linial conjectured that for all n and d, the average sensitivity of a degree-d polynomial threshold function on n variables is maximized by the degree-d symmetric polynomial which computes the parity function on the d layers of the hypercube with Hamming weight closest to n=2. We refute the conjecture for almost all d and for almost all n, and we confirm the conjecture in many of the remaining cases.
Cite
CITATION STYLE
Chapman, B. (2018). The gotsman-linial conjecture is false. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 692–699). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975031.45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.