Title :
Lower bounds for the complexity of reliable Boolean circuits with noisy gates
Author_Institution :
Dept. of Comput. Sci., Chicago Univ., IL, USA
Abstract :
It is proved 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 probability. The Ω(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
Keywords :
Boolean functions; circuit reliability; computational complexity; logic circuits; logic gates; Boolean function; block sensitivity; complexity; fixed positive probability; lower bounds; noisy gates; reliable Boolean circuits; Boolean functions; Circuit noise; Computer science; Error probability; Redundancy; Signal to noise ratio; Upper bound;
Conference_Titel :
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location :
San Juan
Print_ISBN :
0-8186-2445-0
DOI :
10.1109/SFCS.1991.185424
