[Proof Complexity] Postdoc and PhD positions in TCS at KTH Royal Institute of Technology

Jakob Nordström jakobn at kth.se
Wed Dec 20 12:57:30 CET 2017

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 postdocs and PhD students in TCS (including proof complexity).

The positions are within a research project led by Johan Hastad, Per Austrin, and Jakob Nordstrom focusing mostly on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity, but excellent researchers or students interested in neighbouring areas such as, e.g., communication complexity, circuit complexity, algebraic complexity, and harmonic analysis are also warmly welcome to apply.

In addition to the PIs, the research project is planned to involve a total of 4-5 postdocs and 4-5 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 21, 2018. See http://apc.csc.kth.se/D-2017-0898-Eng.php and http://apc.csc.kth.se/D-2017-0885-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)


More information about the Proof-Complexity mailing list