PhD position in SAT solving at KTH Royal Institute of Technology, Stockholm (Sweden)

The TCS Group at KTH Royal Institute of Technology invites applications for a PhD position in CS focusing on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms.

This is a position within the Wallenberg Artificial Intelligence, Autonomous Systems and Software Program WASP, Sweden's largest ever individual research program. The PhD student will be working in the research group of Jakob Nordstrom, which currently consists of 4 postdoctoral researchers and 4 PhD students in addition to the PI. There are also several other professors, postdocs, and PhD students in the TCS Group working on other aspects of algorithms and computational complexity, and so this is an excellent opportunity to explore new connections between theoretical and practical areas of computer science within a vibrant and growing research environment.

This is a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidate is expected to start at the latest in August-September 2018, although this is to some extent negotiable.