Randomized vs. deterministic decision tree complexity for read-once Boolean functions

Rafi Heiman; Avi Wigderson

doi:10.1007/bf01212962

Randomized vs. deterministic decision tree complexity for read-once Boolean functions

Computational Complexity ◽

10.1007/bf01212962 ◽

1991 ◽

Vol 1 (4) ◽

pp. 311-329 ◽

Cited By ~ 12

Author(s):

Rafi Heiman ◽

Avi Wigderson

Keyword(s):

Decision Tree ◽

Boolean Functions ◽

Decision Tree Complexity

Download Full-text

Randomized vs. deterministic decision tree complexity for read-once Boolean functions

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160258 ◽

2002 ◽

Cited By ~ 2

Author(s):

R. Heiman ◽

A. Wigderson

Keyword(s):

Decision Tree ◽

Boolean Functions ◽

Decision Tree Complexity

Download Full-text

Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973082.133 ◽

2011 ◽

Author(s):

Kazuyuki Amano

Keyword(s):

Decision Tree ◽

Boolean Functions ◽

Decision Tree Complexity

Download Full-text

Decision tree complexity and Betti numbers

Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 ◽

10.1145/195058.195414 ◽

1994 ◽

Cited By ~ 14

Author(s):

Andrew Chi-Chih Yao

Keyword(s):

Decision Tree ◽

Betti Numbers ◽

Decision Tree Complexity

Download Full-text

On the Monte Carlo Boolean decision tree complexity of read-once formulae

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160259 ◽

2002 ◽

Cited By ~ 12

Author(s):

M. Santha

Keyword(s):

Monte Carlo ◽

Decision Tree ◽

Decision Tree Complexity

Download Full-text

An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,

Automata, Languages, and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39206-1_59 ◽

2013 ◽

pp. 696-708

Author(s):

Nikos Leonardos

Keyword(s):

Lower Bound ◽

Decision Tree ◽

Decision Tree Complexity

Download Full-text

Decision tree complexity of graph properties with dimension at most 5

Journal of Computer Science and Technology ◽

10.1007/bf02950404 ◽

2000 ◽

Vol 15 (5) ◽

pp. 416-422 ◽

Cited By ~ 3

Author(s):

Suixiang Gao ◽

Guohui Lin

Keyword(s):

Decision Tree ◽

Decision Tree Complexity ◽

Graph Properties

Download Full-text

Gems in decision tree complexity revisited

ACM SIGACT News ◽

10.1145/2527748.2527763 ◽

2013 ◽

Vol 44 (3) ◽

pp. 42-55

Author(s):

Raghav Kulkarni

Keyword(s):

Decision Tree ◽

Decision Tree Complexity

Download Full-text

COMPARITIVE ANALYSIS OF DETERMINISTIC AND NONDETERMINISTIC DECISION TREE COMPLEXITY. GLOBAL APPROACH

Fundamenta Informaticae ◽

10.3233/fi-1996-25205 ◽

1996 ◽

Vol 25 (2) ◽

pp. 201-214 ◽

Cited By ~ 14

Author(s):

Mikhail Moshkov

Keyword(s):

Decision Tree ◽

Global Approach ◽

Decision Tree Complexity

Download Full-text

Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach

Transactions on Rough Sets IV - Lecture Notes in Computer Science ◽

10.1007/11574798_7 ◽

2005 ◽

pp. 125-143 ◽

Cited By ~ 10

Author(s):

Mikhail Ju. Moshkov

Keyword(s):

Comparative Analysis ◽

Decision Tree ◽

Local Approach ◽

Decision Tree Complexity

Download Full-text

Entropy lower bounds for quantum decision tree complexity

Information Processing Letters ◽

10.1016/s0020-0190(01)00191-0 ◽

2002 ◽

Vol 81 (1) ◽

pp. 23-27 ◽

Cited By ~ 5

Author(s):

Yaoyun Shi

Keyword(s):

Decision Tree ◽

Lower Bounds ◽

Decision Tree Complexity

Download Full-text