Useful Links
Computer Science
Algorithms and Data Structures
Computational Complexity Theory
1. Introduction to Computational Complexity Theory
2. Mathematical Foundations
3. Models of Computation
4. Complexity Measurement
5. Time Complexity Classes
6. Reducibility and NP-Completeness
7. Space Complexity Theory
8. Hierarchy Theorems
9. Polynomial Hierarchy
10. Randomized Complexity
11. Interactive Proof Systems
12. Circuit Complexity
13. Quantum Complexity
14. Advanced Topics
Space Complexity Theory
Space Complexity Fundamentals
Space Measurement Models
Work Tape Model
Read-Only Input
Space-Constructible Functions
Logarithmic Space Classes
Deterministic Logarithmic Space L
Definition and Examples
Reachability Problems
Nondeterministic Logarithmic Space NL
Definition and Examples
Graph Connectivity
Polynomial Space Classes
Polynomial Space PSPACE
Definition and Examples
Game Problems
Nondeterministic Polynomial Space NPSPACE
Definition and Relationship to PSPACE
Exponential Space Classes
Exponential Space EXPSPACE
Definition and Examples
Space-Time Relationships
Inclusion Relationships
L ⊆ NL ⊆ P ⊆ NP ⊆ PSPACE
Separation Results
Open Problems
Key Space Complexity Theorems
Savitch's Theorem
Statement: PSPACE = NPSPACE
Proof Technique
Implications
Immerman-Szelepcsényi Theorem
Statement: NL = co-NL
Proof Technique
Significance
PSPACE-Completeness
Definition and Proof Techniques
Quantified Boolean Formulas
QBF Problem
Alternating Quantifiers
Game Theory Applications
Two-Player Games
Geography Game
Generalized Game Problems
Previous
6. Reducibility and NP-Completeness
Go to top
Next
8. Hierarchy Theorems