P versus PSPACE
Can every problem that is solvable with a polynomial amount of memory also be solved in polynomial time?
Summary
PSPACE contains P, NP and the polynomial hierarchy and is contained in EXPTIME. Because P is known to be strictly smaller than EXPTIME, at least one of the inclusions P ⊆ PSPACE ⊆ EXPTIME is strict, but it is not known which; all are widely suspected to be strict.
Source
Open, as listed by Wikipedia · Unsolved problems in computer science. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.