By Topic

Polynomial threshold functions, AC functions and spectrum norms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. Bruck ; IBM Almaden Res. Center, San Jose, CA, USA ; R. Smolensky

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

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990