By Topic

On the maximum tolerable noise of k-input gates for reliable computation by 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
$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)
Evans, W.S. ; Dept. of Comput. Sci., Univ. of British Columbia, Vancouver, BC, Canada ; Schulman, L.J.

We determine the precise threshold of component noise below which formulas composed of odd degree components can reliably compute all Boolean functions.

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 11 )