PSPACE
Set of decision problems / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about AP (complexity)?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
"Polynomial space" redirects here. For for spaces of polynomials, see Polynomial ring.
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.