Universiteit van Amsterdam

Please note that this newsitem has been archived, and may contain outdated information or links.

Postdoc positions at KTH Royal Institute of Technology, Stockholm (Sweden)

Deadline: Sunday 15 January 2017

The Theory Group at KTH Royal Institute of Technology invites applications for up to four postdoctoral positions in theoretical computer science.[b][b]The postdoc positions are in the area of computational complexity theory, 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. [b][b]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, the research project is planned to involve a total of 4-5 postdocs and 5-7 PhD students. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.[b][b]These postdoc positions are full-time employed positions for one year with a possible one-year extension. The expected starting date is in August-September 2017, although this is to some extent negotiable.[b][b]The application deadline is January 15, 2017. See http://apc.csc.kth.se/D-2016-0871-Eng.php for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to .

For more information, see http://apc.csc.kth.se/D-2016-0871-Eng.php or contact APC co-PIs at .

Please note that this newsitem has been archived, and may contain outdated information or links.