A coding theorem for distributed computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for noisy Boolean decision trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the effect of analog noise in discrete-time analog computations
Neural Computation
A theorem on sensitivity and applications in private computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Error-resilient DNA computation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Computation in noisy radio networks
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computing Boolean Functions from Multiple Faulty Copies of Input Bits
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Computing Boolean functions from multiple faulty copies of input bits
Theoretical Computer Science - Latin American theorotical informatics
| Hi-index | 0.00 |
It is proved that the reliable computation of any Boolean function with, sensitivity s requires Omega (s log s) gates if the gates of the circuit fail independently with a fixed positive probability. The Omega (s log s) bound holds even if s is the block sensitivity instead of the sensitivity of the Boolean function. Some open problems are mentioned.