Sign inSign in

Decision tree depth

The decision tree depth of the negation of a function is the same as the decision tree depth of the function itself.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 0:49The Switching Lemma: PRST Version

Lectures that assume it

2

Connections

9

The lectures that define it or assume it, and the concepts next to it.

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.