Course AC: Algorithms and Complexity
(LNMB, Fall 2019)

This basic course explains the basics of algorithms and complexity. It assumes only knowledge of basic mathematics (set and logic notation, linear algebra, proof by induction, probability theory, big-O notation).

LNMB page:

Lecturer: Marie Schmidt ( and Jesper Nederlof  (

Acknowledgement: Much of the material used in this course was previously developed by Gerhard Woeginger.

Exercises (four series)
(If you have questions, send me an email or ask me on Monday)

Important: comments on the homework

Note: For those lacking background in algorithms design, we recommend to (at least) browse through the first 3 chapters of `Introduction to Algorithms’ by Cormen, Leiserson, Rivest and Stein

Summary of lectures

Extra material

Updated on September 07, 2019
by Jesper Nederlof (based on a previous version by G.J. Woeginger)