in Krakow offers a Ph.D. position in the project "Empty promises of Thomas
Jerome Schaefer".
The position is in the research area that employs algebraic tools to
investigate the computational complexity of the Promise Constraint
Satisfaction Problem (PCSP) on a Boolean domain. The computational problems
investigated within the project are usually easy to state, but often
require novel approaches and tools from quite remote branches of computer
science.
We invite all applicants with a strong motivation for research.
Further details can be found at
https://marcinkozik.staff.tcs.uj.edu.pl/PhDShaefer/
**********************************************************
*
* 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
