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 constraint
satisfaction problems and is at the intersection of several areas of
mathematics and theoretical computer science (general algebra, logic,
computational complexity, combinatorics, analysis). Please see
http://www.karlin.mff.cuni.cz/~barto/cocosym.html
for more information.
The starting date of the PhD study is October 2019. The applicant is
expected to have the master degree completed by this date. The duration is
four years. 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 an (unofficial)
academic transcript in a single PDF file to Libor Barto (
libor.barto@mff.cuni.cz) by April 14, 2019. Applicants should also arrange
for at least two recommendation letters to be sent directly to the same
email address by the same date. 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
