[Job-offers-cs] PostDoc in Complexity Theory at KTH Stockholm

[Pekka Orponen]

-------- Forwarded Message --------
Subject: [DMANET] PostDoc in Complexity Theory at KTH Stockholm
Date: Wed, 15 Jan 2020 10:24:18 +0100
From: Per Austrin <austrin at kth.se>
To: dmanet at zpr.uni-koeln.de

A postdoc position is open in the Approximability and Proof Complexity 
project at KTH Royal Institute of Technology in Stockholm.

The postdoc position is in the area of computational complexity theory, 
focusing on questions at the intersection of approximation algorithms 
and subexponential algorithms. Examples of topics of particular interest 
are the use of linear and semidefinite programming to solve hard 
combinatorial problems, or  to prove that the problems are beyond the 
reach of such methods. Exciting recent developments have identified the 
so-called sums of squares hierarchy as a unifying theme for these 
questions, and one aim of our research is to build and expand on this 
theme. However, we will also freely explore whatever other methods turn 
out to be helpful for attacking these and other topics of interest in 
algorithms and complexity theory. If so desired, up to 20% teaching can 
be included in the position.

Application deadline: January 23.

Link to the position:
https://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:308077/where:4/

Questions about the position can be directed to either:
Per Austrin <austrin at kth.se>
Johan Håstad <johanh at kth.se>