ConceptTheory & Algos
Decision tree depth under restriction
The probability that a decision tree restricted by a random restriction has depth at least h is bounded by a function of epsilon, width, and h divided by h factorial.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.