PhD Course at ITU: Advanced Topics in Computational Complexity.

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

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

• Fine-grained complexity
• Algebraic complexity
• Existential theory of the reals
• Fragile complexity
• Proof complexity
• Parameterised complexity
• Sigma two completeness

We are hoping to meet every second week, likely Fridays, starting 10:15, at ITU.

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

Daily schedule will be:

• 10:15 am to noon: Theme 1
• noon to 1:15 pm: Lunch break
• 1:15 pm to 3 pm: Theme 2
• 3 pm: cake break
• Finally: Continued discussions either together or in groups, inspired by today's topics.

Who can sign up:

• Prerequisites: mathematical maturity, knowledge of computational complexity.
• Any PhD student of computer science, mathematics, or closely related topics can join.
• In case of doubt, or in case you are not a PhD student, you must contact the course organisers to enroll. Include a transcript of passed courses and projects in your mail.

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