 List of PSPACE-complete problems

PSPACE-complete problems are decision problems that are both in PSPACE (problems solvable in polynomial space) and as hard as any problem in PSPACE. This means that if any PSPACE-complete problem can be solved in polynomial time, then every problem in PSPACE can also be solved in polynomial time, implying that PSPACE = P.