T-79.240 Special Course on Computational Complexity (3 cr)Autumn 2002
[General Information]
[Lectures]
[Tutorials]
[Home assignments]
[TOPI]
Previous years: [Autumn 2001] [Autumn 2000] [Autumn 1999] [Autumn 1998] This is an advanced course on computational complexity covering topics such as NP-completeness, randomized algorithms, cryptography, approximation algorithms, parallel algorithms, polynomial hierarchy, PSPACE-completeness.
General Information
Lecture Notes(Slides in English; Postscript form)
Tutorials
Home Assignments
[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links] Latest update: 25 August 2003. |