Several funded PhD positions are available in Oxford University's Department of Computer Science, supported by an ERC Starting Grant and a Royal Society Grant held by Standa Zivny. The goal of these projects is to understand the mathematics and computational complexity of constraint satisfaction problems (CSPs), mostly via the lens of convex relaxations (such as linear programming and semidefinite programming). The positions are available from 1 October 2018 and will be for 3 years (with the possibility of extension). The positions come with a travel support and no teaching duties (but the possibility of doing some teaching). The students will be members of Oxford's Algorithms and Complexity Theory Group. The candidates should have a first-class degree in mathematics or theoretical computer science. While there is no general deadline, applications received by 8 January will also be eligible for other sources of funding from Oxford's Department of Computer Science and thus will receive full consideration. Informal inquiries by email (standa.zivny@cs.ox.ac.uk <mailto:standa.zivny@cs.ox.ac.uk>) are welcome.
To apply, proceed as described in the link below and mention Standa Zivny in your application as the primary supervisor.
http://www.cs.ox.ac.uk/news/1371-full.html <http://www.cs.ox.ac.uk/news/1371-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/
*
**********************************************************
Posts
