Computational Complexity Theory
A branch of theoretical computer science focused on classifying computational problems according to their inherent difficulty, and relating these classes to each other. Central concepts include P, NP, and NP-completeness.