DM553/MM850: Complexity and Computability


Announcements:
  1. None.

Assignments:
  1. None 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):

Lecture notes and problems for discussions sections:
  1. Note 1.

Notes about proofs: Notes.
Teaching assistant's, David Hammer's ("instruktors") homepage.
Exam information for 2020: Compared to 2018, for 2020, there is less about finite automata, and there is the material in "Course Materials" in Blackboard about parameterized algorithms. More information will be available later.
Exam information for 2018:
"Questions" and additional exam information.
"Pensum" (material students should know for the exam).
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
   

 


   Data protection at SDUDatabeskyttelse på SDU