Logic List Mailing Archive

PhD student positions in theoretical computer science, Stockholm (Sweden), Deadline: 23 Oct 2017

The Theory Group at KTH Royal Institute of Technology invites applications 
for PhD positions in theoretical computer science.

KTH Royal Institute of Technology is the leading technical university in 
Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) 
offers a strong research environment spanning a wide range of research 
topics such as complexity theory and approximation algorithms, computer 
and network security, cryptography, formal methods and natural language 
processing. We have one of Europe's most prominent groups in algorithms 
and complexity theory, and the research conducted here has attracted 
numerous international awards and grants in recent years.

The PhD positions are in the area of computational complexity theory, 
focusing on questions at the intersection of approximation algorithms, 
subexponential algorithms, and proof complexity. Examples of topics of 
particular interest are the use of linear and semidefinite programming to 
solve hard combinatorial problems, or of proof complexity to prove that 
the problems are beyond the reach of such methods. Exciting recent 
developments have identified the so-called sums of squares hierarchy as a 
unifying theme for these questions, and one aim of our research is to 
build and expand on this theme. However, we will also freely explore 
whatever other methods turn out to be helpful for attacking these and 
other topics of interest in algorithms and complexity theory. The 
overarching goal is to understand fundamental properties of efficient 
computation by proving mathematical theorems about the power and 
limitations of different computational models.

This research project is led by Johan Hastad, Per Austrin, and Jakob 
Nordstrom, and is financed by grants from the Knut and Alice Wallenberg 
Foundation, the European Research Council, and the Swedish Research 
Council.

In addition to the PIs and the announced PhD positions, the research 
project will also involve 3-4 PhD students and 3-4 postdocs. Thus, this 
will be a unique opportunity to explore new connections between different 
subareas of complexity theory within a vibrant and growing research 
environment.

These are four-year full-time employed positions, but PhD positions 
usually (though not necessarily) include 20% teaching, in which case they 
are prolonged for one more year. The successful candidates are expected to 
start at the latest in January 2018, although this is to some extent 
negotiable. The positions are fully funded and come with a competitive 
salary.

The application deadline is October 23, 2017. See 
http://apc.csc.kth.se/D-2017-0619-Eng.php for the full announcement with 
more information and instructions how to apply. Informal enquiries about 
this position are welcome and may be sent to apc@csc.kth.se .


--
[LOGIC] mailing list
http://www.dvmlg.de/mailingliste.html
Archive: http://www.illc.uva.nl/LogicList/

provided by a collaboration of the DVMLG, the Maths Departments in Bonn and Hamburg, and the ILLC at the Universiteit van Amsterdam