Course

CS-524: Computational complexity

Summary

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.

Lectures

Instructor

Mika Tapani Göös

Website https://theory.epfl.ch/mika/ Teaching & PhD PhD Students Valentin Imbach, Ziyi Guan, Artur Riazanov, Anastasiia Sofronova, Weiqiang Yuan Past EPFL PhD Students Maystre Gilbert Théodore Courses Computational complexity CS-524 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 o

Official source

https://edu.epfl.ch/coursebook/en/computational-complexity-CS-524

Moodle Page

http://go.epfl.ch/CS-524

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Summary

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.

Lectures

Instructor

Mika Tapani Göös

Official source

https://edu.epfl.ch/coursebook/en/computational-complexity-CS-524

Moodle Page

http://go.epfl.ch/CS-524

About this result

Related courses (31)

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

EE-556: Mathematics of data: from theory to computation

This course provides an overview of key advances in continuous optimization and statistical analysis for machine learning. We review recent learning formulations and models as well as their guarantees

PHYS-512: Statistical physics of computation

The students understand tools from the statistical physics of disordered systems, and apply them to study computational and statistical problems in graph theory, discrete optimisation, inference and machine learning. ...

PHYS-467: Machine learning for physicists

Machine learning and data analysis are becoming increasingly central in sciences including physics. In this course, fundamental principles and methods of machine learning will be introduced and practised. ...

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented. ...