[Proof Complexity] PhD positions in computational complexity at KTH Royal Institute of Technology

[Jakob Nordström]

Dear colleagues,



We would be very grateful for your assistance in spreading the information that the Theory Group at KTH Royal Institute of Technology is looking for PhD students in computational complexity (including proof complexity).



The positions are within a research project led by Johan Hastad, Per Austrin, and Jakob Nordstrom focusing on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity. Examples of topics of particular interest are the use of linear and semidefinite programming to solve hard combinatorial problems, or of proof complexity 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.



In addition to the PIs and the announced PhD positions, the research project will also involve 3-4 PhD students and 3-4 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.



The application deadline is October 23, 2017. See http://apc.csc.kth.se/D-2017-0619-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to apc at csc.kth.se .



With best regards,

Jakob Nordstrom



Jakob Nordström, Associate Professor

KTH Royal Institute of Technology

Phone: +46 8 790 69 19 (office), +46 70 742 21 98 (cell)

http://www.csc.kth.se/~jakobn/