PhD Course at ITU: Advanced Topics in Computational Complexity.

Where: IT University of Copenhagen, Rued Langgaards Vej 7, 2300 Kbh S, Auditorium 4 also known as 4A60, on 4th floor of the main building.

This PhD Course is taught by the Algorithms and Complexity group of ITU and friends.

Dates and content:

Feb 6th: Srikanth Srinivasan and Amik Raj Behera: The PCP theorem (and the proof of a weaker version),
See: this google doc for reading material and more.

Feb 20th:
10-12: Lasse Wulf: The polynomial hierarchy, Σ-2-completeness, complexity of robust optimisation problems
See: Reading material
13-17: Radu Curticapean: Algebra for algorithms, fine-grained complexity,
See: https://algebraicgraphalgorithms.wordpress.com/ and https://arxiv.org/abs/2410.02606

Mar 6th:
10-12: Kilian Risse: Supercritical Tradeoffs for Monotone Circuits (see this arxiv paper),
13-17: Ivor van der Hoog: Universal Optimality. See

Mar 20th: Kristoffer Arnsfelt Hansen: PPAD and FIXP.

Apr 17th: TBA,

May 1st: TBA,

May 15th: TBA.

We plan to cover topics such as e.g. the following:

We meet every second week, Fridays, starting 10:15, at ITU. (Except for during Easter.)

These times are chosen to comfortably fit the 08:00 train from Odense and the 08:50 train from Lund.

Daily schedule will be something like:

Who can sign up:

How to sign up: Contact the course organisers, Eva Rotenberg (erot@itu.dk) and Ivor van der Hoog (ivva@itu.dk)