Computing Boolean functions from multiple faulty copies of input bits

Theoretical Computer Science

Volumn 321, Issue 1, 2004, Pages 149-170

  Szegedy, Mario ^a   Chen, Xiaomin ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Boolean functions; Linear programming; Randomized functions; Sensitivity

Indexed keywords

COMPUTATIONAL METHODS; FUNCTION EVALUATION; GRAPH THEORY; LINEAR PROGRAMMING; PROBABILITY; SENSITIVITY ANALYSIS; SET THEORY;

FAULTY COPIES; INPUT BITS; RANDOMIZED FUNCTIONS; SENSITIVITY;

BOOLEAN FUNCTIONS;

EID: 2442434349     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.07.001     Document Type: Conference Paper

References (16)

1. Alon N., Spencer J. The Probabilistic Method. 2000;Wiley, New York.
2. I. Benjamini, G. Kalai, O. Schramm, Noise sensitivity of Boolean functions and applications to percolation, math.PR /9811157 .
3. Bernasconi A. Sensitivity vs. block sensitivity (an average-case study). Inform. Process. Lett. 59:1996;151-157.
4. U. Feige, D. Peleg, P. Raghavan, E. Upfal, Computing with unreliable information, Proc. 22nd Annu. ACM Symp. on Theory of Computing, 1990, pp. 128-137.
5. Gács P., Gál A. Lower bounds for the complexity of reliable Boolean circuits with noisy gates. IEEE Trans. Inform. Theory. 40:1994;579-583.
6. A. Gál, Lower bounds for the complexity of reliable Boolean circuits with noisy gates, Proc. 32nd Annu. IEEE Symp. on Foundations of Computer Science, 1991, pp. 594-601.
7. J. Kahn, G. Kalai, N. Linial, The influence of variables on Boolean functions, Proc. 29th Annu. Symp. on Foundations of Computer Science, 1988, pp. 68-80.
8. Kenyon C., Yao A.C. On evaluating Boolean functions with unreliable tests. Internat. J. Foundations of Comput. Sci. 1. 1:1990;1-10.
9. Von Neumann J. Probabilistic logics and the synthesis of reliable organisms from unreliable components. Shannon C.E., McCarthy J. Automata Studies. 1956;329-378 Princeton University Press, Princeton, NJ.
10. Nisan N. CREW PRAMs and decision trees. SIAM J. Comput. 20:1991;999-1007.
11. N. Nisan, M. Szegedy, On the degree of Boolean functions as real polynomials, Proc. 23rd Annu. ACM Symp. on Theory of Computing, 1991, pp. 419-429.
12. N. Pippenger, On networks of noisy gates, Proc. 26th Annu. Symp. on Foundations of Computer Science, 1985, pp. 30-38.
13. Pippenger N. Invariance of complexity measures for networks with unreliable gates. J. ACM. 36:1989;531-539.
14. R. Reischuk, B. Schmeltz, Reliable computation with noisy circuits and decision trees, Proc. 32nd Annu. Symp. on Foundations of Computer Science, 1991, pp. 602-611.
15. Rubinstein D. Sensitivity vs. block sensitivity of Boolean functions. Combinatorica. 15:1995;297-299.
16. CPLEX, http://www.ilog.com/products/cplex/.