Sign inSign in

Branching program

A directed, acyclic graph with query nodes labeled by variables and two output nodes labeled 0 and 1, defining a Boolean function.
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
  • Michael Sipser

    MIT · Undergraduate

    • 27:32Probabilistic Computation, BPP

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.