PSPACE
Class of computational complexity
PSPACE
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.
Read on Wikipedia · Image Siddharthist, CC BY-SA 4.0
Open boosters, collect cards and trade them. Free to play.
Play for free