Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
On the Computational Power of Boolean Decision Lists
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
| Hi-index | 0.00 |
The class of polynomial-threshold functions is studied using harmonic analysis, and the results are used to derive lower bounds related to AC/sup 0/ 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 L/sub 1/ spectral norm is bounded by a polynomial in n is a polynomial-threshold function, and that a Boolean function whose L/sub infinity //sup -1/ spectral norm is not bounded by a polynomial in n is not a polynomial-threshold function. Some results for AC/sup 0/ functions are derived.