Postdoc position in complexity of arithmetic computations

Institute of Mathematics, Czech Academy of Sciences | Prague, Czech Republic


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. The successful applicant will be based in the Institute of Mathematics of the Czech Academy of Sciences, Prague, and perform research in the areas of the project. He/She is also expected to take part in activities of the Department of Mathematical Logic and Theoretical Computer Science such as seminars and workshops organized by the group. No teaching is involved. Appointment period: 12 months (until June 30, 2023) Find more details and apply through the online application system at

Last updated: 5 November 2021

Tweet Share

Apply by 5 December 2021

Back to Job List