Computational Complexity
Bachelor of Engineering (BEng) · University · Computer Science
Computational Complexity explores the inherent difficulty of computational problems, introducing the classes P, NP, and NP-completeness. This unit provides a foundation for understanding the limitations and capabilities of algorithms.
What's included
- Introduction to Computational Complexity
- Complexity Classes: P
- NP
- and NP-Completeness
- Reductions and NP-Completeness
- Time and Space Complexity Analysis
- The P vs NP Problem
Keywords
- Complexity Classes
- P vs NP Problem
- NP-Completeness
- Algorithm Analysis
- Computational Complexity
- Reductions
- Time Complexity
- Space Complexity