Universiteit van Amsterdam

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

Postdoc position at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for a postdoctoral position in computational complexity and/or SAT solving.

The postdoctoral researcher will be working in the research group of Jakob Nordstrom. Much of the activities of this group revolve around the themes of proof complexity and SAT solving. On the theoretical side, proof complexity has turned out to have deep, and sometimes surprising, connections to other topics such as, e.g., circuit complexity, communication complexity, and hardness of approximation, and therefore researchers in these or other related areas are more than welcome to apply. On the practical side, some interesting problems are to gain a better understanding of the performance of current state-of-the-art SAT solvers --- in particular, solvers using conflict-driven clause learning (CDCL) --- and to explore techniques that would go beyond CDCL, such as approaches based on algebraic or geometric reasoning.

The research project is financed by a Breakthrough Research Grant from the Swedish Research Council and a Starting Independent Researcher Grant from the European Research Council. In addition to the research group leader, the group currently consists of one postdoc and four PhD students. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.

This is a full-time employed position for one year with a possible one-year extension. The successful candidate is expected to start in August-September 2015, although this is to some extent negotiable.

The application deadline is January 25, 2015. More information and instructions how to apply can be found at http://www.csc.kth.se/~jakobn/openings/D-2014-0761-Eng.php . Informal enquiries are welcome and may be sent to Jakob Nordstrom.

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