Mika Göös
EPFL IC IINFCOM THL5
INJ 135 (Bâtiment INJ)
Station 14
1015 Lausanne
+41 21 693 58 10
Office: INJ 135
EPFL › IC › IC-SIN › SIN-ENS
Website: https://sin.epfl.ch
EPFL IC IINFCOM THL5
INJ 135 (Bâtiment INJ)
Station 14
1015 Lausanne
+41 21 693 58 10
Office: INJ 135
EPFL › IC › IC-SSC › SSC-ENS
Website: https://ssc.epfl.ch
Website
Teaching & PhD
Current Phd
Valentin Imbach, Ziyi Guan, Artur Riazanov, Anastasiia Sofronova, Weiqiang Yuan
Past Phd As Director
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.
Theory of computation
This course constitutes an introduction to theory of computation. It discusses the basic theoretical models of computing (finite automata, Turing machine), as well as, provides a solid and mathematically precise understanding of their fundamental capabilities and limitations.