Computational Complexity

Algoritmit ja koneoppiminen
Syventävät opinnot
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.
Vuosi Lukukausi Päivämäärä Periodi Kieli Vastuuhenkilö
2006 kevät -17.01. Suomi