Dmitrii Sokolov
EPFL IC IINFCOM THL5
INJ 136 (Bâtiment INJ)
Station 14
1015 Lausanne
Web site: Web site: https://sin.epfl.ch
Teaching & PhD
Teaching
Computer Science
Courses
Computational complexity
In computational complexity we study the computational resources needed to solve problems and understand the relation between different types of computation.
This course advances the students knowledge of computational complexity, and develop an understanding of fundamental open questions.