ConceptTheory & Algos
EXP
The complexity class of problems solvable in exponential time, specifically 2 to the power of a polynomial in n.
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
2Each in their own terms, from the easiest level.
Ryan O'Donnell
The complexity class of languages solvable in deterministic exponential time .Erik Demaine
The set of all problems that can be solved in exponential time.
Lectures that assume it
2Connections
10The lectures that define it or assume it, and the concepts next to it.