Computational complexity is a field from theoretical computer science concerned with the study of computational problems and organises them in various classes corresponding to the amount of resources (like time or memory) that are needed to solve the problems.

The course will cover the core material from this discipline, such as the important complexity classes (including, but not limited to, P and NP), as well as the classical results relating these classes.