Sign inSign in

Σ2\Sigma_2

A complexity class in the polynomial hierarchy corresponding to Σ2P=NPNP\Sigma_2^P = \text{NP}^{\text{NP}}.
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.

NP2Polynomial hierarchy1Polynomial-time Turing machine1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Anil Adad

    Carnegie Mellon University · Undergraduate

    A complexity class containing languages decidable by a polynomial-time verifier with an existential and then a universal quantifier.
    • 20:00The Polynomial Hierarchy

Connections

6

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

Concepts4

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.