Intermediate
Theory of Computation
Q56 / 100
What is the complexity class PSPACE?
Correct! Well done.
Incorrect.
The correct answer is B) Problems decidable by a deterministic TM in polynomial space (but possibly exponential time)
B
Correct Answer
Problems decidable by a deterministic TM in polynomial space (but possibly exponential time)
Explanation
PSPACE contains all problems solvable in O(nᵏ) space. P ⊆ NP ⊆ PSPACE ⊆ EXP. PSPACE-complete examples: QBF (Quantified Boolean Formula), TQBF.
Progress
56/100