Sign inSign in

Polynomial time hierarchy

A hierarchy of complexity classes generalizing P, NP, and co-NP.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 4 definitions
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 1:08:41Quantum "Supremacy"
    • 39:16Oracles, and the Polynomial Time Hierarchy vs. circuits
    • 0:02The Polynomial Time Hierarchy

Lectures that assume it

4

Connections

17

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

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.