Sign inSign in

Parity circuit lower bounds

The theorem stating that depth-2 circuits (CNF/DNF) computing the parity function require exponential size 2n−12^{n-1}.
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.

CNF and DNF formulas1Parity function1

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    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.