581380
Computational Complexity
Komplexitetsteori
Computational Complexity
8
Algorithms and machine learning
Advanced studies
The course is an intermediate-level course on complexity theory indended to provide basic background to go over some of the classical results in the area. The list of topics includes material on P, NP, space complexity, polynomial hierarchy, circuit complexity, randomized complexity, interactive proofs, and PCPs. Some familiarity with basic concepts of computability such as finite-state automata, Turing machines, and discrete algorithms is assumed. No separate exam.
Re-occurence
Discontinued
Upcoming separate exams
No exams.
Course pages
No courses yet.