By Topic

Better bounds for threshold formulas

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

1 Author(s)
J. Radhakrishnan ; Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA

The computation of threshold functions using formulas over the basis {AND, OR, NOT} is considered. It is shown that every monotone formula that computes the threshold function Tkn/2⩽kn2, has size Ω(nk log (n/(k-1))). The same lower bound is shown to hold even in the stronger monotone contact networks model. Nearly optimal bounds on the size of ΣΠΣ formulas computing Tkn for small k are also shown

Published in:

Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on

Date of Conference:

1-4 Oct 1991