Products and help bits in decision trees

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 1035-1050

  Nisan, Noam ^a   Rudich, Steven ^b   Saks, Michael ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Carnegie Mellon University   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Decision trees; Help bits

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

DECISION TREES; HELP BITS;

TREES (MATHEMATICS);

EID: 0032284177     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539795282444     Document Type: Article

References (23)

1. [ABG] A. AMIR, R. BEIGEL, AND W. GASARCH, Some connections between bounded query classes and nonuniform complexity, in Proc. Structure in Complexity 5th Annual Conference, IEEE Computer Society, Los Alamitos, CA, 1990, pp. 232-243.
2. [Ant] M. ANTHONY, On the Number of Boolean Functions of a Given Threshold Order, Technical Report LSE-MPS-36, London School of Economics, 1992.
3. [Be87] R. BEIGEL, A structural theorem that depends quantitatively on the complexity of SAT, in Proc. Structure in Complexity 2nd Annual Conference, IEEE Computer Society, Los Alamitos, CA, 1987, pp. 28-32.
4. [Be93] R. BEIGEL, The polynomial method in circuit complexity, in Proc. Structure in Complexity 8th Annual Conference, IEEE Computer Society, Los Alamitos, CA, 1993, pp. 82-95.
5. [BH] R. BEIGEL AND T. HIRST, One help bit doesn't help, in Proc. 30th ACM Symposium on Theory of Computing, Dallas, 1998, pp. 124-130.
6. 0 functions and spectral norms, SIAM J. Discrete Math., 21 (1992), pp. 33-42.
7. [Bsh] N. H. BSHOUTY, On the extended direct sum conjecture, in Proc. 21st ACM Symposium on Theory of Computing, Association of Computing Machinery, New York, 1989, pp. 177-185.
8. [Cai] J. CAI, Lower bounds for constant depth circuits in the presence of help bits, Inform. Process. Lett., 36 (1990), pp. 79-84.
9. [CH] J. CAI AND L. HEMACHANDRA, Enumerative counting is hard, Inform, and Comput., 82 (1989), pp. 34-44.
10. [CGHFRS] B. CHOR, O. GOLDREICH, J. HÅSTAD, J. FRIEDMAN, S. RUDICH, AND R. SMOLENSKY, The bit extraction problem of t-resilient functions, in Proc. 26th Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1985, pp. 396-407.
11. [FKN] T. FEDER, E. KUSHILEVITZ, AND M. NAOR, Amortized communication complexity, in Proc. 32nd Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1991, pp. 239-248.
12. [GF] G. GALBIATI AND M. J. FISCHER, On the complexity of 2-output boolean networks, Theoret. Comput. Sci., 16 (1981), pp. 177-185.
13. [IRW] R. IMPAGLIAZZO, R. RAZ, AND A. WIGDERSON, A direct product theorem, in Proc. 9th Conference on Structure in Complexity Theory, IEEE Computer Society, Los Alamitos, CA., 1994, pp. 88-96.
14. [JT] J. JA'JA' AND J. TAKCHE, On the validity of the direct sum conjecture, SIAM J. Comput., 15 (1986), pp. 1004-1020.
15. [KKN] M. KARCHMER, E. KUSHILEVITZ, AND N. NISAN, Fractional covers and communication complexity, in Proc. 7th Conference on Structures in Complexity Theory, IEEE Computer Society, Los Alamitos, CA, 1992, pp. 202-274.
16. [KRW] M. KARCHMER, R. RAZ, AND A. WIGDERSON, On proving super-logarithmic depth lower bounds via the direct sum in communication complexity, in Proc. 6th Conference on Structures in Complexity Theory, IEEE Computer Society, Los Alamitos, CA, 1991, pp. 299-304.
17. [Lin] N. LINIAL, personal communication, Jerusalem, 1993.
18. [Paul] W. J. PAUL, Realizing boolean functions on disjoint set of variables, Theoret. Comput. Sci., 2 (1978), pp. 383-396.
19. [Raz] R. RAZ, A parallel repitition theorem, in Proc. 27th annual ACM Symposium on Theory of Computing, Association of Computing Machinery, New York, 1995, pp. 447-456.
20. [Sa93] M. SAKS, Slicing the hypercube, in Surveys in Combinatorics, Keith Walker, ed., London Math. Soc. Lecture Note Ser. 187, Cambridge University Press, Cambridge, UK, 1993, pp. 211-255.
21. [Ulig] D. ULIG, On the synthesis of self-correcting schemes from functional elements with a small number of reliable components, Math Notes Acad. Sci. USSR, 15 (1974), pp. 558-562.
22. [Vaz] U. VAZIRANI, Randomness, Adversaries and Computation, Ph.D. Thesis, Department of Computer Science and Electrical Engineering, U.C. Berkeley, Berkeley, CA, 1986.
23. [Y2] A. YAO, Probabilistic computations: Towards a unified measure of complexity, in Proc. 18th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1977, pp. 222-227.