Lund University is seeking a PhD student in theoretical computer science.
Position description
We invite applications for one to two PhD positions in computational complexity theory. At the heart of computational complexity theory is the quest to understand the nature of efficient computation. What makes a problem computationally hard or easy? How can we show that every algorithm that solves a certain problem must necessarily consume a large amount of resources (such as time or memory, say)? The study of the potential and limits of efficient computation is about foundational, mathematical, research, but research results in computational complexity theory have had major impact in other areas of computer science and other scientific disciplines, and have given rise to some of the most important open problems in modern mathematics. The position also comes with travel funding and the opportunity to spend six months abroad.
The group’s research spans various facets of complexity theory, encompassing both combinatorial and logical perspectives. Key areas of interest include proof complexity, circuit complexity, communication complexity, meta-complexity, and their connections to algorithms.
