The TCS Group at KTH invites applications for postdoc positions 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 application deadline is February 4, 2019. Informal enquiries are welcome and may be sent to jakobn@kth.se .

Website: http://www.csc.kth.se/~jakobn/openings/J-2018-3178-Eng.php
Email: jakobn@kth.se