## AIRO Young Opportunity

**Expires**

14 Jun 2019

**Institution**

Lund

**Country**

Sweden

**Description**

The Department of Computer Science at Lund University invites applications for a postdoctoral position in theoretical computer science.

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). Examples of theoretical questions of interest are analyzing proof systems formalizing the computational power of GrÃ¶bner bases (polynomial calculus) and integer linear programming (cutting planes), and proving stronger lower bound in the hierarchy of Frege proof systems. 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.

Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.

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 application deadline is June 14, 2019. See https://lu.mynetworkglobal.com/en/what:job/jobID:270663/ for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to jakob.nordstrom@cs.lth.se.

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). Examples of theoretical questions of interest are analyzing proof systems formalizing the computational power of GrÃ¶bner bases (polynomial calculus) and integer linear programming (cutting planes), and proving stronger lower bound in the hierarchy of Frege proof systems. 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.

Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.

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 application deadline is June 14, 2019. See https://lu.mynetworkglobal.com/en/what:job/jobID:270663/ for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to jakob.nordstrom@cs.lth.se.