PhD position in TCS at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for a PhD position in Theoretical Computer Science.

This position is funded by the research project "Understanding the Hardness of Theorem Proving" in the area of proof complexity with connections to SAT solving, and much of the activities of the research group revolve around these themes. However, proof complexity has also turned out to have deep, and sometimes surprising, connections to other areas such as, e.g., circuit complexity, communication complexity, and hardness of approximation, and therefore research in these or other related areas are also of interest.

The project is led by Jakob Nordström (http://www.csc.kth.se/~jakobn) and is described briefly at http://www.csc.kth.se/~jakobn/project-proofcplx. The group currently consists of one postdoctoral researcher and two PhD students (in addition to the project leader) and also receives short-term and long-term visitors on a regular basis.

This is a full-time employed position, normally for five years including 20% teaching, with salary according to KTH PhD student regulations (internationally very competitive). The successful candidate is expected to start at the latest in August 2013, although this is to some extent negotiable.

The application deadline is May 5, 2013, but candidates are encouraged to apply right away since applications are reviewed on a continuous basis. See http://www.csc.kth.se/~jakobn/openings/D-2013-0301-Eng.php for the full, formal announcement with more information and instructions for how to apply. Informal enquiries about this position are welcome and may be sent to Jakob Nordstrom.