DM508: Algorithms and Complexity

Announcement: Problem 1 on the last assignment has been corrected.
Lecture notes:
  1. Note 1 (also in PDF).
  2. Note 2 (also in PDF). Contains the first assignment.
  3. Note 3 (also in PDF).
  4. Note 4 (also in PDF).
  5. Note 5 (also in PDF).
  6. Note 6 (also in PDF). Contains the second assignment.
  7. Note 7 (also in PDF).
  8. Note 8 (also in PDF).
  9. Note 9 (also in PDF). Contains the last assignment.
  10. Note 10 (also in PDF).
  11. Note 11 (also in PDF).

E-mail address for "instruktor":
Slides for Cook's Theorem in PDF.

Exam questions for DM508 for March 2007: also in PDF.
Note that the slides for Cook's Theorem and a slide for the Matcher algorithm for the KMP string matching algorithm will be available at the exam.

IMADA HOME | SDU HOME | Previous page |
Last modified: Mon Mar 5 13:36:21 CET 2007 - Joan Boyar