An improved lower bound for the randomized decision tree complexity of recursive majority

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

Volumn 7965 LNCS, Issue PART 1, 2013, Pages 696-708

  Leonardos, Nikos ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

Boolean functions; decision tree complexity; generalized costs; lower bounds; query complexity; randomized computation

Indexed keywords

GAME TREES; GENERALIZED COST; LOWER BOUNDS; QUERY COMPLEXITY; RANDOMIZED DECISIONS; RECURSIONS; TREE COMPLEXITY; UPPER BOUND;

BOOLEAN FUNCTIONS; DATA MINING; DECISION TREES; TREES (MATHEMATICS);

AUTOMATA THEORY;

EID: 84880308033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-39206-1_59     Document Type: Conference Paper

References (10)

1. Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1), 21-43 (2002)
2. Heiman, R., Newman, I., Wigderson, A.: On read-once threshold formulae and their randomized decision tree complexity. Theor. Comput. Sci. 107(1), 63-76 (1993)
3. Heiman, R., Wigderson, A.: Randomized vs. deterministic decision tree complexity for read-once boolean functions. Computational Complexity 1, 311-329 (1991)
4. Jayram, T.S., Kumar, R., Sivakumar, D.: Two applications of information complexity. In: STOC, pp. 673-682. ACM (2003)
5. Landau, I., Nachmias, A., Peres, Y., Vanniasegaram, S.: The lower bound for evaluating a recursive ternary majority function and an entropy-free proof. Undergraduate Research Reports, Department of Statistics, University of California, Berkeley (2006)
6. Magniez, F., Nayak, A., Santha, M., Xiao, D.: Improved bounds for the randomized decision tree complexity of recursive majority. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 317-329. Springer, Heidelberg (2011)
7. Saks, M.E., Wigderson, A.: Probabilistic boolean decision trees and the complexity of evaluating game trees. In: FOCS, pp. 29-38. IEEE Computer Society (1986)
8. Santha, M.: On the monte carlo boolean decision tree complexity of read-once formulae. Random Struct. Algorithms 6(1), 75-88 (1995)
9. Sherman, J.: Communicated to the author by Ryan O'Donnell in 12 September 2012 (unpublished, 2007)
10. Snir, M.: Lower bounds on probabilistic linear decision trees. Theor. Comput. Sci. 38, 69-82 (1985)