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

Jakob Nordström jakobn at kth.se
Wed Mar 1 13:07:13 CET 2017

Dear colleagues,

I would very much appreciate your assistance in spreading the information that the Theory Group at KTH Royal Institute of Technology is looking for postdocs and PhD students in SAT solving (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 March 31, 2017. See http://www.csc.kth.se/~jakobn/openings/D-2017-0119-Eng.php and http://www.csc.kth.se/~jakobn/openings/D-2017-0118-Eng.php, respectively, for full announcements with more information and instructions how to apply. Informal enquiries are welcome and may be sent to jakobn at kth.se .

Please note that these are additional announcements on top of earlier announcements D-2016-0833 and D-2016-0872 due to additional research funding. Candidates who already applied for these positions should not apply again --- all applicants for the announcements are evaluated in parallel.

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)


More information about the Proof-Complexity mailing list