Computer science Computational complexity: resources and classes Concept
PSPACE
Summary
PSPACE is the complexity class of decision problems that a deterministic Turing machine can solve with polynomial space. It contains P and NP, since a machine running in polynomial time can only use polynomial space. Typical problems in PSPACE ask who wins a two-player game of polynomial length, or whether a quantified Boolean formula is true. It is not known whether P or NP equals PSPACE.
Where this leads
6 pages build on this one.
Further reading
About this page
| Tag | T9NTRY93ZT |
|---|---|
| URI | m2://T9NTRY93ZT |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q15 |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.