Theoretical Computer Science

CS 406 Theoretische Informatik

Spring Semester 2021 | German

The lecture provides an algorithm-oriented introduction to central areas of theoretical computer science such as basic computational models and mutual simulations, decidability, complexity theory (definition and structure of basic complexity classes, reducibility, NP-completeness), information theory and cryptography, automata theory, basics of programming languages and syntax analysis.


News

  • 2021-02-26: The first lecture takes place on Monday, 1 March 2021, 15:30 – 17:00 in WIM-ZOOM-15.
  • 2021-02-15: The course website for 2021 is online.

Question Time


Materials

The lecture slides and videos as well as the exercise sheets and their corresponding solutions are available in the lecture's ILIAS course.


Literature

  • Wegener, Ingo: Theoretische Informatik – eine algorithmen­orientierte Einführung, Teubner Verlag, 2005.
  • Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Algorithmen – Eine Einführung, Oldenbourg, 2010.