Sign inSign in

PSPACE

The class of decision problems solvable by a Turing machine using a polynomial amount of space.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 7 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.

Space complexity5Complexity classes3Polynomial space2Polynomial time2Turing machine2Deterministic Turing machine1Polynomials1SPACE(f(n))1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 51:48Space Complexity
    • 21:13Course Introduction and Overview
    • 53:48Quantum Complexity
  • Michael Sipser

    MIT · Undergraduate

    The class of languages decidable by a deterministic Turing machine using a polynomial amount of space.
    • 2:39PSPACE-Completeness
    • 6:55Space Complexity, PSPACE, Savitch's Theorem
  • Scott Aaronson

    Graduate Mathematics · Graduate

    The class of problems that can be computed with a polynomial amount of memory and up to exponential time.
    • 26:34Complexity and Computability with Closed Timelike Curves

Lectures that assume it

7

Connections

22

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

Concepts8

Show 2 more

3 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.