The course gives an insight into the classical complexity theory. The concepts of resource consumption and reduction known from computer science 3 are motivated, repeated and deepened.
The concept of the completeness of a problem is thoroughly investigated again by NP as an example, and complete problems are also presented for other complexity classes such as P, NL and PSPACE. Randomized complexity classes are also investigated.
In another chapter, the approximability of NP-complete problems is investigated.