Coursebooks 2016-2017

PDF
 

Theoretical computer science

CS-352

Lecturer(s) :

Language:

English

Remarque

pas donné en 2016-17

Summary

An in-depth introduction to some of the key ideas and tools of Theoretical Computer Science. Covered material touches upon: streaming algorithms, spectral graph theory, interactive and zero-knowledge proofs, pseudorandomness, algorithmic game theory, and quantum computing.

Content

 

Keywords

theoretical computer science, algorithms, computational complexity, streaming algorithms, spectral graph theory, randomness, pseudorandomness, algorithmic game theory, quantum computing

Learning Prerequisites

Required courses

CS-150 Discrete Structures

CS-250 Algorithms

CS-251 Theory of Computation (former name: Theoretical Computer Science/Informatique théorique)

Mathematical maturity, i.e., ability to read and write mathematical proofs

Learning Outcomes

By the end of the course, the student must be able to:

Transversal skills

Teaching methods

Ex cathedra with exercises

Assessment methods

Continuous control (problem sets and exams during the semester, no final exam)

In the programs

Reference week

 MoTuWeThFr
8-9     
9-10     
10-11     
11-12     
12-13     
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22     
Under construction
 
      Lecture
      Exercise, TP
      Project, other

legend

  • Autumn semester
  • Winter sessions
  • Spring semester
  • Summer sessions
  • Lecture in French
  • Lecture in English
  • Lecture in German