Sign inSign in

Williams' theorem '11

A theorem showing the existence of a language in NEX that cannot be computed by constant-depth polynomial-size circuits with AND, OR, NOT, and mod gates.
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.

AC0[6] circuits1Circuit lower bounds1NEX1

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.