The class of polynomial-threshold functions is studied using harmonic analysis, and the results are used to derive lower bounds related to AC0 functions. A Boolean function is polynomial threshold if it can be represented as a sign function of a sparse polynomial (one that consists of a polynomial number of terms). The main result is that polynomial-threshold functions can be characterized by means of their spectral representation. In particular, it is proved that a Boolean function whose
Published in:
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Date of Conference: 22-24 Oct 1990