Advanced Topics in Computational Complexity

Organizer(s): 

Professor Eva Rotenberg and co-organiser asisstant professor Ivor van der Hoogfrom ITU

Lecturer(s):

Eva Rotenberg, Nutan Limaye, Riko Jacob, Holger Dell, Radu Curticapean, Thore Husfeldt, Ivor van der Hoog from ITU
External lecturers: TBA

Date(s) of the course: February through May.

Time: Fridays 10:15 to 16:30.

Course website:
https://algorithms.itu.dk/atcc.html

For further information than provided here, please see the course website.

Course description:

PhD students will get insights into modern-day computational complexity theory. The PhD students get experience working with proofs and exercises in these mathematical models. The PhD students are able to understand and compare results that are on the forefront of computational complexity theory.

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

Reading list:

The reading list will consist of recent research papers, and will be provided well in advance on the course homepage.

Prerequisites:

Please see the course website. 

Assessment:

Oral presentations.

Credits:

5 ECTS. 

Number of hours the student is expected to use on the course:

Participation: 40 hours
Preparation: 120 hours.

How to sign up:

Please see the course website.