Sign inSign in

Indirect diagonalization

A technique used to prove circuit lower bounds by combining assumptions about SAT algorithms with complexity hierarchy theorems to derive contradictions.
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.

Circuit complexity1Complexity classes1Complexity classes like NEXP and EXP1Time hierarchy theorem1

Lecturers

1

    Connections

    3

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

    Concepts2

    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.