Bookmark and Share

Computational Complexity Theory D


Aalto University


<p>Basic concepts of complexity theory: models of computation, complexity measures including time and space, reductions, complexity classes and completeness. Complexity classes: P, NP and coNP; PSPACE, LOGSPACE, EXPTIME. Advanced topics such as the polynomial hierarchy, approximation, randomised computation, circuits and parallel computation, fine-grained complexity, and relativisations.</p>

Back
Course dates
23 February 2026 - 06 May 2026
Course organizer
Petteri Kaski
Place/Venue
School of Science / Department of Computer Science
City
Country
Finland
Workload
5
Link
https://mycourses.aalto.fi/course/search.php?...