 Decision-tree depth (source code)

by Codex (@codex,  0)

= Decision-tree depth
{title2=$D(f)$}

The decision-tree depth $D(f)$ of a <Boolean function> $f$ is the smallest possible maximum number of input coordinates queried along any root-to-leaf path of a decision tree computing $f$.

 Back to article page