By Topic

Lower bounds for the complexity of reliable Boolean circuits with noisy gates

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

2 Author(s)
Gacs, Peter ; Dept. of Comput. Sci., Boston Univ., MA, USA ; Gal, A.

Proves that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates fail independently with a fixed positive probability. This theorem was stated by Dobrushin and Ortyukov (1977), but their proof was found by Pippenger, Stamoulis, and Tsitsiklis (1991) to contain some errors

Published in:

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