Published November 2003
| Version public
Journal Article
Open
On the maximum tolerable noise of k-input gates for reliable computation by formulas
Creators
Abstract
We determine the precise threshold of component noise below which formulas composed of odd degree components can reliably compute all Boolean functions.
Additional Information
© Copyright 2006 IEEE. Reprinted with permission. Manuscript received October 15, 2002; revised May 22, 2003. [Posted online: 2003-11-17] The work of W.S. Evans was supported in part by the Natural Sciences and Engineering Research Council of Canada. The work of L.J. Schulman was supported in part by the National Science Foundation and the Charles Lee Powell Foundation. Communicated by G. Battail, Associate Editor At Large. The authors would like to thank the anonymous referees for their comments.Files
EVAieeetit03.pdf
Files
(431.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:a347f233c9e8ffc1d83b324843e73817
|
431.1 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 5242
- Resolver ID
- CaltechAUTHORS:EVAieeetit03
Dates
- Created
-
2006-10-05Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field