Algoritm- och komplexitetsteori MN1, vt-05. [Theory of Algorithms and Complexity MN1]

• Guest lectures:
  • Svante Janson (Dept. Math., Uppsala), On algorithm analysis, April 25.
  • Hajime Ishihara (JAIST, Japan), Computational complexity of the intermediate value theorem, April 28.
• Aktuellt schema [Latest Schedule].
• Annons med kursinnehåll [Announcement and course content]
• Formell kursplan.
• Kurslitteratur: C.H. Papadimitriou, Computational Complexity, Addison-Wesley, 1995. Errata for 1994 edition.
• Examination
  • Obligatory Hand-in Problems, part 1.
  • Obligatory Hand-in Problems, part 2.
  • Obligatory Hand-in Problems, part 3.
  • Final written exam on May 31, 10.15-12.15, in room 2347.
  • Exam corrected - results posted on the Math. Dept. notice board. Those who have not yet passed, please contact me.
• Links
  • The Complexity Zoo
  • Theory group at NADA, KTH.

June 5, 2005, Erik Palmgren