Sign inSign in

Space complexity

The class of problems that can be decided using a bounded amount of tape cells as a function of the input size.
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

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    The amount of memory space an algorithm requires to run as a function of the input size.
    • 2:17Space Complexity
    • 21:11Savitch's Theorem and NL
  • Michael Sipser

    MIT · Undergraduate

    The number of tape cells a Turing machine visits during its computation.
    • 1:46Space Complexity, PSPACE, Savitch's Theorem

Lectures that assume it

21

The first 12 are shown.

Connections

34

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.