Saarland University
Department of Computer Science
Computational Complexity
Computational Complexity

Publications

Teaching

Workshops

Advanced Complexity Theory

Prof. Dr. Markus Bläser

Topic

We will learn the proof of the famous PCP theorem and its applications, the construction of expander graphs and Reingold's algorithm for undirected connectivity.

Time & Date

First lecture on 28th Oct (Wednesday).

Lecturer

Script