[DL] Fwd: [Proof Complexity] Postdoc and PhD positions in computational complexity at KTH Royal Institute of Technology

Camilo Thorne camilo.thorne at gmail.com
Thu Dec 15 17:12:28 CET 2016


Camilo Thorne

Mannheim, Germany

mobile: +49(0)15202380352
http://camilothorne.com

"Exegi monumentum aere perennius"
(Horatius, Ode III-30)

---------- Forwarded message ----------
From: Jakob Nordström <jakobn at kth.se>
Date: Thu, Dec 15, 2016 at 3:37 PM
Subject: [Proof Complexity] Postdoc and PhD positions in computational
complexity at KTH Royal Institute of Technology
To: "proof-complexity at math.cas.cz" <proof-complexity at math.cas.cz>


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
up to four postdocs and four 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.

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.

The application deadline is January 15, 2017. See
http://apc.csc.kth.se/D-2016-0871-Eng.php and http://apc.csc.kth.se/D-2016-
0832-Eng.php, respectively, for full announcements 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/


_______________________________________________
Proof-Complexity mailing list
Proof-Complexity at math.cas.cz
https://list.math.cas.cz/listinfo/proof-complexity
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.informatik.uni-bremen.de/pipermail/dl/attachments/20161215/b90d4e48/attachment.html>


More information about the dl mailing list