PhD Positions in Theoretical Computer Science, Stockholm (Sweden)

The Theoretical Computer Science group at KTH Computer Science and Communication (KTH CSC) invites applications for PhD positions in Theoretical Computer Science with a focus on proof complexity and connections to SAT solving. The students will work in the research project "Understanding the Hardness of Theorem Proving", which aims to understand what makes formulas hard or easy in practice by combining theoretical study and practical experiments (as well as gain theoretical insights into other crucial but poorly understood issues in SAT solving). The project is led by Jakob Nordström.

The application deadline is January 20, 2012 but candidates are encouraged to apply already now. See http://www.csc.kth.se/~jakobn/openings/D-2011-0503-Eng.php for the full, formal announcement with more information. Informal enquiries about these positions are welcome and may be sent to Jakob Nordström at jakobn at csc.kth.se.