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.

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. This is a position within the Wallenberg Artificial Intelligence, Autonomous Systems and Software Program (WASP),  providing a valuable network with other researchers within WASP.

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 would ideally start sometime as early as possible in 2019, though this is negotiable. The position is fully funded and comes with a competitive salary. To receive full consideration your application should be submitted by the deadline October 31, 2018, but candidates will be reviewed continuously and early applications are strongly encouraged.