TCS / Studies / T-79.240 Special Course on Computational Complexity
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

T-79.240 Special Course on Computational Complexity (3 cr)

Autumn 2004

[General Information] [Lectures] [Tutorials] [Home assignments] [Other Interesting Stuff] [TOPI]

Previous years: [Autumn 2003] [Autumn 2002] [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

Back to menu.

Lecture Notes

(Slides in English; Postscript form) Back to menu.


Back to menu.

Home Assignments

  • See the program for the home assignments for each week.
  • See the practical arrangements for details about submitting and grading home assignments.
Back to menu.

Other Interesting Stuff

Back to menu.
[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 24 January 2005.