[Proof Complexity] Postdoc positions in SAT solving at KTH Royal Institute of Technology

[Jakob Nordström]

Dear colleagues,



I would very much appreciate your assistance in spreading the information that the Theory Group at KTH is looking for postdocs focused on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms (with close connections to proof complexity).



The positions are within the research group led by Jakob Nordstrom. Much of the activities of this group revolve around the themes of efficient algorithms for satisfiability in propositional logic (SAT solving) and lower bounds on the efficiency of methods for reasoning about SAT (proof complexity). On the practical side, one problem of interest is to gain a better understanding of, and improve, the performance of current state-of-the-art SAT solvers --- in particular, solvers using conflict-driven clause learning (CDCL). We are even more interested in exploring new techniques that hold out the theoretical possibility of exponential improvements over CDCL, but seem hard to implement efficiently in practice, e.g., algebraic methods such as Groebner bases or geometric methods such as pseudo-Boolean solving.



The application deadline is February 4, 2019. See http://www.csc.kth.se/~jakobn/openings/J-2018-3178-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakobn at kth.se .



With best regards,

Jakob Nordstrom



Jakob Nordström, Associate Professor

KTH Royal Institute of Technology

Phone: +46 8 790 69 19 (office), +46 70 742 21 98 (cell)

http://www.csc.kth.se/~jakobn/