Sciweavers

FOCS
1991
IEEE
14 years 3 months ago
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál