← Jargon

Jargoncomputer science· 3 claims· 1 episode

PSPACE

The complexity class of problems solvable using a polynomial amount of memory, even if that takes exponential time; contains P and NP.

As defined in 99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity


Where it comes up · 1

Most important claims · 3 of 3Search all claims for “PSPACE” →