Computational Complexity Theory
- is a subfield of Computational Theory and Complexity Theory
- focuses on classifying computational problems according to their inherent difficulty and relating these classes to each other. A computation problem is solvable by a mechanical application of mathematical steps, such as an algorithm