Sign inSign in

Karp-Lipton theorem

A theorem stating that if NP is contained in P/poly, then the polynomial time hierarchy collapses.
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.

Polynomial time hierarchy2Non-uniform complexity (P/poly)1NP1P/poly1

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 2:23Instance Checking and the Permanent

Connections

5

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

Concepts3

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.