Saarland University
Department of Computer Science
Computational Complexity
Computational Complexity

Publications

Teaching

Workshops

Complexity Theory

Prof. Dr. Markus Bläser

News

Endterm is finally graded. I am sorry for the long delay.

Final grade is the average between midterm and endterm (unless you take the re-exam). A value exactly between to grades is rounded to the better one. I will announce some time slots in which you can have a look at your exam. Please send Thatchaphol an email if you want to take the re-exam.

The reason for being so late is that we are organising a workshop on algebraic complexity theory next week. Attending the talks is free for local students nevertheless please register so that we know how much coffee we will need during the breaks.

Time & Date

Lecturer

Assistants

Prerequesites

Grundzüge der Theoretischen Informatik (Introduction to Automata Theory, Computability, and Complexity) is quite helpful

Grading

50% Midterm + 50% Endterm or 100% Reexam

Exam

Information for the endterm exam:

Assignments

Tutorials are Fri 10-12 in E1.3, SR 016. First tutorial Nov 6.

Script

Literature