The postdoc position is in the area of computational complexity theory, focusing on questions at the intersection of approximation algorithms and subexponential algorithms. . This is includes both hardness results and algorithmic results. If so desired, up to 20% teaching can be included in the position. The position is for one year with a possible (and likely) extension to a second year.

Website: https://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:308077/where:4/
Email: johanh@kth.se