decision tree complexity Latest Research Papers

On the Decision Tree Complexity of Threshold Functions

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-030-50026-9_14 ◽

2020 ◽

pp. 198-210

Author(s):

Anastasiya Chistopolskaya ◽

Vladimir V. Podolskii

Keyword(s):

Decision Tree ◽

Threshold Functions ◽

Decision Tree Complexity

Download Full-text

Improved bounds for the randomized decision tree Complexity of recursive majority

Random Structures and Algorithms ◽

10.1002/rsa.20598 ◽

2015 ◽

Vol 48 (3) ◽

pp. 612-638 ◽

Cited By ~ 5

Author(s):

Frédéric Magniez ◽

Ashwin Nayak ◽

Miklos Santha ◽

Jonah Sherman ◽

Gábor Tardos ◽

...

Keyword(s):

Decision Tree ◽

Decision Tree Complexity

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

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

Three Approaches to Deal with Inconsistent Decision Tables - Comparison of Decision Tree Complexity

Lecture Notes in Computer Science - Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing ◽

10.1007/978-3-642-41218-9_6 ◽

2013 ◽

pp. 46-54 ◽

Cited By ~ 2

Author(s):

Mohammad Azad ◽

Igor Chikalov ◽

Mikhail Moshkov

Keyword(s):

Decision Tree ◽

Decision Tree Complexity ◽

Decision Tables

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

Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority

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

10.1007/978-3-642-22006-7_27 ◽

2011 ◽

pp. 317-329 ◽

Cited By ~ 3

Author(s):

Frédéric Magniez ◽

Ashwin Nayak ◽

Miklos Santha ◽

David Xiao

Keyword(s):

Decision Tree ◽

Decision Tree Complexity

Download Full-text

Optimal direct sum results for deterministic and randomized decision tree complexity

Information Processing Letters ◽

10.1016/j.ipl.2010.07.020 ◽

2010 ◽

Vol 110 (20) ◽

pp. 893-897 ◽

Cited By ~ 4

Author(s):

Rahul Jain ◽

Hartmut Klauck ◽

Miklos Santha

Keyword(s):

Decision Tree ◽

Direct Sum ◽

Decision Tree Complexity

Download Full-text

Class-Oriented Reduction of Decision Tree Complexity

Lecture Notes in Computer Science - Foundations of Intelligent Systems ◽

10.1007/978-3-540-68123-6_5 ◽

2008 ◽

pp. 48-57 ◽

Cited By ~ 1

Author(s):

José-Luis Polo ◽

Fernando Berzal ◽

Juan-Carlos Cubero

Keyword(s):

Decision Tree ◽

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

decision tree complexity
Recently Published Documents

TOTAL DOCUMENTS

H-INDEX

On the Decision Tree Complexity of Threshold Functions

Improved bounds for the randomized decision tree Complexity of recursive majority

Gems in decision tree complexity revisited

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

Three Approaches to Deal with Inconsistent Decision Tables - Comparison of Decision Tree Complexity

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

Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority

Optimal direct sum results for deterministic and randomized decision tree complexity

Class-Oriented Reduction of Decision Tree Complexity

Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach

Export Citation Format

decision tree complexityRecently Published Documents

TOTAL DOCUMENTS

H-INDEX

On the Decision Tree Complexity of Threshold Functions

Improved bounds for the randomized decision tree Complexity of recursive majority

Gems in decision tree complexity revisited

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

Three Approaches to Deal with Inconsistent Decision Tables - Comparison of Decision Tree Complexity

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

Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority

Optimal direct sum results for deterministic and randomized decision tree complexity

Class-Oriented Reduction of Decision Tree Complexity

Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach

decision tree complexity
Recently Published Documents