By Topic

Lower bounds on threshold and related circuits via communication complexity

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
$31 $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

3 Author(s)
Roychowdhury, V.P. ; Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA ; Orlitsky, A. ; Kai-Yeung Siu

Using communication complexity concepts and techniques, we derive linear (Ω(n)) and almost-linear (Ω(n/logn)) lower bounds on the size of circuits implementing certain functions. Our approach utilizes only basic features of the gates used, hence the bounds hold for general families of gates of which the symmetric and threshold gates are special cases. Each of the bounds derived is shown to be tight for some functions and some applications to threshold circuit complexity are indicated. The results generalize and in some cases strengthen recent results

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 2 )