PSPACE, EXPTIME
← Back to Complexity Classes
Higher complexity classes beyond NP. PSPACE contains problems solvable with polynomial space, and EXPTIME contains problems solvable in exponential time. These classes contain problems believed to be harder than NP-Complete.