PSPACE

"Polynomial space" redirects here. For for spaces of polynomials, see Polynomial ring.
Inclusions of complexity classes including P, NP, co-NP, BPP, P/poly, PH, and PSPACE
Unsolved problem in computer science:
⁠⁠
(more unsolved problems in computer science)

In computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.