Coursebooks 2018-2019

PDF

Computational complexity

CS-524

Lecturer(s) :

Svensson Ola Nils Anders

Language:

English

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.

Content

Keywords

theoretical computer science

computational complexity

 

Learning Prerequisites

Recommended courses

Theory of computation (CS-251)

Algorithms (CS-250)

 

Learning Outcomes

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

Transversal skills

Teaching methods

Lecturing and exercises

 

Expected student activities

Actively attending lectures and exercise sessions.  Also homeworks and exam.

 

Supervision

Office hours Yes
Assistants Yes
Forum Yes

Resources

Virtual desktop infrastructure (VDI)

No

Bibliography

Sanjeev Arora and Boaz Barak: Computational Complexity: A Modern Approach, Cambridge University Press.

Ressources en bibliothèque
Websites

In the programs

Reference week

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

legend

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