[DMANET] Postdoc position in Algorithms and Complexity at Oxford

A postdoc position is available in the Department of Computer Science at the University of Oxford as part of the ERC Starting Grant Power of Algorithms in Discrete Optimisation (PowAlgDO) led by Standa Zivny. The project focuses on establishing the power of convex relaxations (such as linear and semidefinite programming) for various classes of constraint satisfaction problems (CSPs) and on exact and approximate counting complexity of CSPs and related problems (such as holant problems). Strong candidates with any background in maths or theoretical computer science will considered.

The initial appointment is for one year, with the possibility of an extension until December 2021. The starting date is flexible. The position comes with a travel support and no teaching duties. The postholder will be a member of Oxford's Algorithms and Complexity Theory Group. Salary £41,526 – £49,553 p.a.

The closing date is 12 noon on Monday 31 August UK time.

More details can be found at http://www.cs.ox.ac.uk/news/1836-full.html

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************