[Job-offers-cs] Postdoc in computational complexity theory

[Pekka Orponen]

-------- Forwarded Message --------
Subject: [DMANET] Postdoc in computational complexity theory
Date: Tue, 5 Nov 2019 09:37:25 +0000
From: Igor Carboni Oliveira <igorcarb at gmail.com>
To: dmanet at zpr.uni-koeln.de

A Postdoctoral Research Fellow position at the University of Warwick in 
the area of computational complexity theory is available for up to 16 
months ending in March/2021. The start date can be negotiated for the 
successful candidate. Deadline for application: 3 December 2019.

You will be based in the Department of Computer Science at the 
University of Warwick, and you will be associated with the Centre for 
Discrete Mathematics and its Applications 
(https://warwick.ac.uk/fac/cross_fac/dimap/) and the Division of Theory 
and Foundations (https://warwick.ac.uk/fac/sci/dcs/research/focs/).

The position is available in connection with a research grant of Igor 
Carboni Oliveira (https://www.dcs.warwick.ac.uk/~igorcarb/) on new 
approaches to unconditional complexity lower bounds. The main objective 
of the post is to investigate complexity lower bounds using algorithmic, 
combinatorial, and/or logical methods, and to explore algorithmic 
consequences of complexity lower bounds in areas such as learning, 
cryptography, and derandomization.

Applications must be submitted to the online system. Please visit 
https://www.dcs.warwick.ac.uk/~igorcarb/ for more information.