Complexity Theory is a beautiful field that studies different models of computation as well as their relationships to each other. The most famous open problem in this field is the P vs. NP problem. In this course, you will discover elegant proof techniques, exciting open questions, and fascinating ideas.
Check back here in March 2022 for more information.
This course is available for Bachelor and Master students! You must have mastered Algorithms and Data Structures 1 and 2! (or equivalent)