The TCS Group at KTH 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. See http://www.csc.kth.se/~jakobn/openings/J-2018-0940-Eng.php for more information. Informal enquiries are welcome and may be sent to jakobn@kth.se .

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