to work on the ERC funded project Symmetry in Computational Complexity
(CoCoSym) under the supervision of Libor Barto at the Department of
Algebra, Faculty of Mathematics and Physics, Charles University, Prague.
The project concerns the complexity and approximability of fixed-template
constraint satisfaction problems over finite domains and their
generalization to infinite domains and weighted relations. Please see
http://www.karlin.mff.cuni.cz/~barto/cocosym.html
for more information.
The duration of the position will be between one and three years. The
starting day is flexible, applications will be considered until the
position is filled. The position carries no teaching load. The position is
fully funded from the ERC grant, funding for conference travel is also
available.
Applicants should send a CV, a statement of research experience and
interests, and a list of publications (that may include a short annotation
of at most three of their best papers) in a single PDF file to Libor Barto (
libor.barto@mff.cuni.cz). Applicants should also arrange for at least two
recommendation letters to be sent directly to the same email address.
Informal inquiries are welcome.
**********************************************************
*
* 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
