Computational Complexity Theory
Work Tape Model
Read-Only Input
Definition and Examples
Reachability Problems
Graph Connectivity
Game Problems
Definition and Relationship to PSPACE
L ⊆ NL ⊆ P ⊆ NP ⊆ PSPACE
Statement: PSPACE = NPSPACE
Proof Technique
Implications
Statement: NL = co-NL
Significance
QBF Problem
Alternating Quantifiers
Two-Player Games
Geography Game
Generalized Game Problems
Previous
6. Reducibility and NP-Completeness
Go to top
Next
8. Hierarchy Theorems