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
Complexity Measurement
Resource Bounding Concepts
Time Complexity
Definition and Measurement
Time-Constructible Functions
Space Complexity
Definition and Measurement
Space-Constructible Functions
Other Resources
Randomness
Parallelism
Communication
Input Size and Encoding
Input Representation
Encoding Schemes
Size Measures
Analysis Types
Worst-Case Analysis
Definition and Significance
Adversarial Inputs
Average-Case Analysis
Definition and Challenges
Distribution Assumptions
Best-Case Analysis
Definition and Limitations
Amortized Analysis
Definition and Applications
Previous
3. Models of Computation
Go to top
Next
5. Time Complexity Classes