Back بيسبايس Arabic PSPACE Catalan PSPACE Czech PSPACE German PSPACE Spanish PSPACE French PSPACE HE PSPACE Italian PSPACE Japanese PSPACE Korean

PSPACE

"Polynomial space" redirects here. 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.

From Wikipedia, the free encyclopedia · View on Wikipedia

Developed by Nelliwinne