Every degree-d polynomial threshold function has polylogarithmic Boolean surface area bounded by C_d (log(en))^{C_d}.
Klivans, Ryan O'Donnell, and Rocco A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Boolean surface area of polynomial threshold functions
Every degree-d polynomial threshold function has polylogarithmic Boolean surface area bounded by C_d (log(en))^{C_d}.