Questions tagged [decision-trees]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
17
votes
1answer
2k views

Algorithm for optimizing decision trees

Background A binary decision tree $T$ is a rooted tree where each internal node (and root) is labeled by an index $j \in \{1,..., n\}$ such that no path from root to leaf repeats an index, the leafs ...
10
votes
1answer
598 views

Canonical representation of Binary Decision Tree in Ptime?

I am wondering whether there may exist a way to give a sort of "normal form" for binary decision trees (BDT) in a tractable way. More precisely: a BDT is a tree with internal nodes labelled by ...
13
votes
2answers
616 views

Provable gaps between decision tree complexity and "true" complexity

The title is a little misleading: but hopefully the question isn't: Grønlund and Pettie's new result showing that 3SUM has only $O(n^{3/2})$ decision tree complexity got me wondering: Is there a ...
3
votes
0answers
585 views

Is there a tight lower bound on the complexity of SSSP on a graph?

I'm an undergrad and I'm not sure if this is the right way to ask this question. I want to know the lower bound on single-source shortest path computation in a general graph. The graph is allowed to ...