Sign inSign in

NPSPACE

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

  • Michael Sipser

    MIT · Undergraduate

    The class of decision problems solvable by a nondeterministic Turing machine using a polynomial amount of space.
    • 2:39PSPACE-Completeness
    • 1:01:40Space Complexity, PSPACE, Savitch's Theorem

Lectures that assume it

1

Connections

9

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.