On optimal placements of processors in Tori networks
M. Blaum, J. Bruck, et al.
IPDPS 1996
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 L1 spectral norm is bounded by a polynomial in n is a polynomial-threshold function, and that a Boolean function whose L∞-1 spectral norm is not bounded by a polynomial in n is not a polynomial-threshold function. Some results for AC0 functions are derived.
M. Blaum, J. Bruck, et al.
IPDPS 1996
M. Blaum, J. Bruck
ISIT 1993
Bowen Alpern, Larry Carter, et al.
FOCS 1990
J. Bruck, Luc de Coster, et al.
IPDPS 1994