The research for the advertised position will be within a project concerning parameterized complexity of constraint satisfaction problems (CSP). CSPs are a highly important class of formalisms across many subareas of computer science (for instance, automated reasoning, machine learning, scheduling, computational linguistics, optimisation, computational biology, and verification). Parameterized complexity is a quickly growing area within theoretical science that allows for the development of algorithms for computationally hard problems that exhibit certain structural properties (that often are encountered in real-world instances.) The parameterized view on computation has led to a theory that is simultaneously mathematically challenging and practically applicable.
The application deadline is May 28, 2023. For further information visit
https://liu.se/en/work-at-liu/vacancies/21872
**********************************************************
*
* 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
