PhD positions in Theoretical Computer Science at KTH Royal Institute of Technology, Stockholm (Sweden)
The Theory Group at KTH Royal Institute of Technology invites applications for 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 Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation, the European Research Council, and the Swedish Research Council.
In addition to the PIs and the announced PhD positions, the research project will also involve 3-4 existing PhD students and 4-5 postdocs. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.