DM553: Complexity and Computability

  1. First lecture Tuesday, February 6, 10:15-12, U154.

  1. None assigned yet.

Textbooks and notes:
  1. Introduction to the Theory of Computation, 3rd edition, by Michael Sipser, Cengage Learning, 2013. This is for the first half of the course, and should be available in the bookstore.
  2. Introduction to Algorithms, 3rd edition, by T. Cormen, C. Leiserson, R. Rivest, and C. Stein, MIT Press, 2009. This and the extra notes will be used in the second half of the course.
  3. Extra notes (available from Course Materials in Blackboard)): This is a subset of the notes for DM508 and the same as those for DM553 in 2015 and 2016.

Lecture notes and problems for discussions sections:
  1. Note 1. This will include general information about the course, but is not available yet.

Slides for the formula in the Cook-Levin Theorem: Slides.
Slides for the 2-approximation algorithm for TSP with the triangle inequality: Slides.
Slides about local search: Slides.
Teaching assistant's, David Hammer's ("instruktors") homepage.

Exam information for 2016:
"Questions" and additional exam information.
"Pensum" (material students should know for the exam).

IMADA HOME | SDU HOME | Previous page |
Last modified: Wed Jun 8 16:42:32 CEST 2016 - Joan Boyar