Postdoc - Complexity of computation, communication, and search

The Institute of Mathematics of the Czech Academy of Sciences (IM CAS) is seeking a researcher for the project “Complexity of computation, communication, and search” coordinated by Dr. Pavel Hrubeš and funded by the Czech Science Foundation. Applications are invited from candidates who have completed their PhD within the last 4 years (or will have completed it before the time of hiring), and who have a strong background in computational complexity, with emphasis on complexity of arithmetic circuits, propositional proofs, or communication complexity. The successful applicant will be based at the Institute of Mathematics of the Czech Academy of Sciences, Prague. 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. Please apply ONLY through our online application system https://application.math.cas.cz/Positions.html where you also find more details in the official announcement.

Last updated: 22 January 2025