“An interesting class of problems consists of those that demand a polynomial amount of space. This class is denoted as PSPACE. It is known that NP, the set of problems that can be solved in exponential or factorial time, can be solved in polynomial space. In other words, NP is a subset of PSPACE.”