Lower bounds for noisy Boolean decision trees

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 620-628

  Evans, William ^a   Pippenger, Nicholas ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DECISION TREES; FORESTRY; FOURIER TRANSFORMS; COMPUTATIONAL METHODS; DECISION THEORY; MATHEMATICAL MODELS; NUMERICAL METHODS; PROBABILITY; SPURIOUS SIGNAL NOISE; TREES (MATHEMATICS);

HIGHLY RESILIENT; LOWER BOUNDS; NON LINEAR; PARITY FUNCTIONS; RANDOM INPUT; RANDOM NOISE; SPECTRAL BOUNDS;

BOOLEAN FUNCTIONS;

BINARY TREES; DECISION TREES; LOWER BOUNDS;

EID: 0029711426     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.238013     Document Type: Conference Paper

References (15)

1. Y. Brandman, A. Orlitsky and J. Hennessy, "A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/OR Circuits", IEEE Trans, on Computers, 39 (1990) 282-287.
2. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich and R. Smolensky, "The Bit Extraction Problem or t-Resilient Functions", IEEE Symp. on Foundations of Computer Science, 26 (1985) 396-407.
3. R. L. Dobrushin and S. I. Ortyukov, "Lower Bound for the Redundancy of Self-Correcting Arrangements of Unreliable Functional Elements", Problems of Info. Transm., 13 (1977) 59-65.
4. R. L. Dobrushin and S. I. Ortyukov, "Upper Bound for the Redundancy of Self-Correcting Arrangements of Unreliable Functional Elements", Problems of Info. Transm., 13 (1977) 203-218.
5. U. Feige, D. Peleg, P. Raghavan and E. Upfal, "Computing with Unreliable Information", ACM Symp. on Theory of Computing, 22 (1990) 128-137.
6. J. Friedman, "On the Bit Extraction Problem", IEEE Symp. on Foundations of Computer Science, 33 (1992) 314-319.
7. A. Gal, "Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates", IEEE Symp. on Foundations of Computer Science, 32 (1991) 594-601.
8. P. Gacs and A. Gal, "Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates", MS, 14 pp.
9. W. HoefFding, "Probability Inequalities for Sums of Bounded Random Variables", J. ASA, 58 (1963) 13-30.
10. N. Linial, Y. Mansour and N. Nisan, "Constant Depth Circuits, Fourier Transform, and Learnability", J. ACM, 40 (1993) 607-620.
11. D. E. Muller, "Complexity in Electronic Switching Circuits", IRE Trans, on Electronic Computers, 5 (1956) 15-19.
12. J. von Neumann, "Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components", in: C. E. Shannon and J. McCarthy (editors), Automata Studies, Princeton University Press, 1956, pp. 43-98.
13. N. Pippenger, "On Networks of Noisy Gates", IEEE Symp. on Foundations of Computer Science, 26 (1985) 30-36.
14. N. Pippenger, G. D. Stamoulis and J. N. Tsitsiklis, "On a Lower Bound for the Redundancy of Reliable Networks with Noisy Gates", IEEE Trans, on Info. Theory, 37 (1991) 639-643.
15. R. Reischuk and B. Schmeltz, "Reliable Computation with Noisy Circuits and Decision Trees-A General nlogn Lower Bound", IEEE Symp. on Foundations of Computer Science, 32 (1991) 602-611.