An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, .
Nikos LeonardosPublished in: ICALP (1) (2013)
Keyphrases
- lower bound
- decision trees
- worst case
- upper bound
- branch and bound algorithm
- complexity analysis
- optimal solution
- randomized algorithms
- randomized algorithm
- decision forest
- space complexity
- decision tree algorithm
- data structure
- np hard
- objective function
- decision problems
- predictive accuracy
- lower and upper bounds
- average case complexity
- sufficiently accurate
- concept class
- feature construction
- decision tree induction
- data sets
- branch and bound
- training data
- computational cost
- search algorithm