Making polynomials robust to noise
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Energy-efficient circuit design
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 754.84 |
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