PhD positions in Theoretical Computer science at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for up to four PhD positions in theoretical computer science.

The PhD positions are in the area of computational complexity theory, focusing on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity. The overarching goal is to understand fundamental properties of efficient computation by proving mathematical theorems about the power and limitations of different computational models. This research project is led by Johan Håstad, Per Austrin, and Jakob Nordström. In addition to the PIs and the announced PhD positions, the research project will also involve 2-3 existing PhD students and 3-4 postdocs.