We are looking for a postdoctoral researcher with a strong background in computational complexity, with emphasis on complexity of arithmetic circuits, propositional proofs, or communication complexity to work with the members of the department of Mathematical Logic and Theoretical Computer Science.

Website: https://application.math.cas.cz/Positions.html#page=CALL_LIST
Email: hrubes@math.cas.cz