Sign inSign in

Håstad switching lemma

A lemma stating that applying a random restriction to a wide CNF or DNF formula collapses it into a shallow decision tree with high probability.
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.

Random restriction4Decision tree2CNF1CNF and DNF formulas1DNF1DNF circuits1DNF formula1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 18:07Linial-Mansour-Nisan Theorems

Connections

5

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

Concepts3

Lectures2

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.