Sign inSign in

EXP

The complexity class of problems solvable in exponential time, specifically 2 to the power of a polynomial in n.
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.

Polynomial time2Time complexity classes2Deterministic Turing machines1Exponential function1Polynomial1TIME(t(n))1Turing machine1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    The complexity class of languages solvable in deterministic exponential time 2nc2^{n^c}.
    • 37:04Search-to-Decision, Padding, Dichotomy Theorems
    • 3:00Problems in P
  • Erik Demaine

    MIT · Undergraduate

    The set of all problems that can be solved in exponential time.
    • 2:01Computational Complexity

Lectures that assume it

2

Connections

10

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

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.