The Institute of Mathematics of the Czech Academy of Sciences (IM CAS) is seeking a researcher for the project “Efficient approximation algorithms and circuit complexity” coordinated by Pavel Hrubeš and funded by the Czech Science Foundation.

We invite applications from candidates who have completed their PhD degree in Mathematics, within the last 2 years. A successful applicant will be expected to work on topics pertaining to the complexity of arithmetic computations, this includes the hardness of computing the permanent by general arithmetic circuits, or their restricted versions, such as non-commutative computation.

This is a 12-months appointment with no possibility of extension.

For more details please see
http://www.math.cas.cz/recrutements/postes.php?lang=0