A postdoc position on the complexity of CSPs is available at Oxford, supported by Standa Zivny’s ERC grant. The goal of the project is to study tractability (in a broad sense) of CSPs and convex relaxations. An ideal candidate would have a strong background in universal algebra and/or approximation algorithms/relaxations.

Website: http://www.cs.ox.ac.uk/news/1505-full.html
Email: standa.zivny@cs.ox.ac.uk