Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Computing Boolean Functions from Multiple Faulty Copies of Input Bits
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
A Note on the Bottleneck Counting Argument
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Lower Bounds for the Noisy Broadcast Problem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Self-Stabilizing Microprocessor: Analyzing and Overcoming Soft Errors
IEEE Transactions on Computers
Threshold circuits of bounded depth
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Analysis of defect tolerance in molecular crossbar electronics
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Reliable computations based on locally decodable codes
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Private circuits II: keeping secrets in tamperable circuits
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
A turing machine resisting isolated bursts of faults
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Making polynomials robust to noise
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Boolean functions over nano-fabrics: improving resilience through coding
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Energy-efficient circuit design
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
We show that many Boolean functions (including, in a certain sense, "almost all" Boolean functions) have the property that the number of noisy gates needed to compute them differs from the number of noiseless gates by at most a constant factor. This may be contrasted with results of von Neumann, Dobrushin and Ortyukov to the effect that (1) for every Boolean function, the number of noisy gates needed is larger by at most a logarithmic factor, and (2) for some Boolean functions, it is larger by at least a logarithmic factor.