Computing Boolean functions from multiple faulty copies of input bits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2286, Issue , 2002, Pages 539-553

  Szegedy, Mario ^a   Chen, Xiaomin ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

LOWER BOUNDS; NOISY CIRCUITS; RECOVERY FUNCTIONS;

BOOLEAN FUNCTIONS;

EID: 23044534750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45995-2_47     Document Type: Conference Paper

References (16)

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