Postdoc position at Lund University, Lund (Sweden)

The Department of Computer Science at Lund University invites applications for a postdoctoral position in theoretical computer science. This postdoc position is a full-time employed position for one year with a possible (and expected) one-year extension. The expected starting date is in August-September 2019, although this is to some extent negotiable.

The postdoctoral researcher will be working in the research group of Jakob Nordström. Much of the activities of this 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). Another interesting area is the use of linear and semidefinite programming to solve hard combinatorial problems and of proof complexity to establish when problems are beyond the reach of such methods. Problems of the kind above have turned out to have deep, and sometimes surprising, connections to other topics such as, e.g., circuit complexity, communication complexity, and hardness of approximation, and therefore researchers in these or other related areas are more than welcome to apply.