swe flag På svenska
School of
Electrical Engineering
and Computer Science
KTH / EECS / TCS / Jakob Nordström / Open positions

Open Positions

Please feel free to drop me a line if you have any questions about any of the openings advertised (or not advertised) on this webpage.

Note, however that we cannot accept applications via e-mail—we can only hire for currently open positions as advertised in official announcements, and all applications must be made via the KTH recruitment system (as per instructions in the announcements).

Postdoc Positions

I have no open positions for postdocs right now, but will likely be hiring postdocs again (in both computational complexity theory and SAT solving) in the autumn of 2019 with an intended starting date of August-September 2020. The offical announcements should hopefully be posted sometime in November-December 2019 or so.

All of our postdoc positions are fully funded positions (including travel money) with an internationally competitive salary.

If you instead want to start collecting grants to list on your CV, you can also try to apply for an Individual Fellowship within the EU Marie Skłodowska-Curie actions program to come and do a postdoc with me. There is currently an open call that closes September 11, 2019. I would particularly welcome applications from strong candidates who want to work in proof complexity, SAT solving, or the intersection of these two areas. Please feel free to contact me if you want to discuss this.

PhD Positions

I have no currently open announcements for PhD students (and all hires we make have to be for currently open positions as advertised in official announcements) but it seems somewhat likely that I will be hiring PhD students again in the autumn or winter of 2019 with an intended starting date of August-September 2020. If this happens, then the offical announcements should hopefully be posted sometime during the autumn of 2019. Also, exceptional candidates are always of interest, and could lead to positions opening earlier. Thus, if any of the old announcements listed below looks interesting, and if you are a very strong candidate, then please feel free to contact me.

I am currently not actively hiring PhD students on the applied side, but any future announcements are likely to be along the lines of this previous announcement for PhD students in SAT solving working on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms.

On the theory side, my latest opening was for PhD students in theoretical computer science together with Johan Håstad and Per Austrin, but future open positions are likely to be more clearly focused on proof complexity and related areas.

All PhD positions in our group are fully funded positions with an internationally very competitive salary.

Master's Thesis Projects

I would be interested in supervising one or several Master's students for thesis work within the framework of the research project briefly outlined below. Please do not hesitate to send me an e-mail to get more detailed information. (Note, however, that these projects are intended for students registered at KTH or who are geographically close and can work on their thesis here at KTH. There is no separate funding available to support foreign students to come to Sweden.)

Formula Hardness and SAT Solving

Given a logic formula, is it possible to set its variables in such a way that the formula is satisfied? This simple looking problem has been on centre stage in theoretical computer science ever since the field got started some 40 years ago, and was recently named as one of the Millennium Prize Problems comprising some of the major challenges for all of mathematics in the 21st century. Today, students of computer science worldwide learn in their introductory theory courses that this so-called SAT problem is what is known as NP-complete, and therefore is very, very hard in practice.

Interestingly, practioners take a somewhat different view. During the last 20 years, SAT has developed from a problem of mainly theoretical interest into a practical approach for solving applied problems. Enormous progress in performance has led to satisfiability algorithms, so-called SAT solvers, becoming a standard tool for solving real-world problems with millions of variables in the context of, for example, hardware and software verification, electronic design automation, artificial intelligence, operations research, and bioinformatics. The theory of NP-completeness did not quite go away, however — for all these SAT solvers there are also known examples of tiny formulas with just a couple of hundred variables that make them fail miserably.

How can modern SAT solvers be so good in practice? How can one know for a particular formula whether it will be hard or easy? Can we extend SAT solvers with new methods of reasoning to make them potentially even more powerful than the best solvers today? These are the kind of questions we want to study in these Master's thesis projects, using a mix of theoretical research and practical experiments.

The projects are intended to give students a feel for what research in theoretical computer science is like, while at the same time focusing on concrete problems of practical importance. Apart from the Master's thesis itself, the intention is that the results will also be published as (parts of) papers in leading scientific conferences and/or journals in the field (in the framework of the research outlined here).

Published by: Jakob Nordström <jakobn~at-sign~kth~dot~se>
Updated 2019-04-27