Sign inSign in

Natural proofs

A framework describing lower bound techniques that are large and constructible.
as Avi Wigderson defines itInstitute for Advanced Study
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 lower bounds2Complexity classes1NP complexity class1

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A formalization of the proof strategy used by all known circuit lower bounds at the time, which Razborov and Rudich showed cannot prove that NP does not have polynomial-size circuits under a cryptographic assumption.

Connections

3

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

Concept1

Lectures2

2 lecturers. 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.