Universiteit van Amsterdam

Please note that this newsitem has been archived, and may contain outdated information or links.

Postdoc in CS Focused on SAT Solving and Combinatorial Optimization, Lund (Sweden)

Deadline: Monday 10 February 2020

The Department of Computer Science at Lund University invites applications for a postdoc position in computer science focused on SAT solving and combinatorial optimization.

The postdoctoral researcher will be working in the research group of Jakob Nordström, which is currently in transition from KTH to a combined location at Lund University and the University of Copenhagen on either side of the Oresund bridge.

Much of the activities of the research 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 based on conflict-driven clause learning (CDCL). We are even more interested in exploring new algebraic or geometric techniques (such as Groebner bases or pseudo-Boolean solving) that could potentially yield exponential improvements over CDCL. We also believe that there should be ample room for technology transfer with related areas such as SMT solving, constraint programming (CP), and/or mixed integer linear programming (MIP), and therefore researchers in these or other related areas are more than welcome to apply.

Please note that this newsitem has been archived, and may contain outdated information or links.