Computational Complexity – Teaching

Lecture Notes

Some popular lecture notes:

• “Grundzüge der Theoretischen Informatik”
• “Grundzüge der Algorithmen und Datenstrukturen”

Current Courses

General

• Research Seminar
• Bachelor’s and Master’s Theses

Summer term 2024

• Lecture “Complexity Theory”
• Lecture “Competitive Programming”
• Proseminar “Das Buch der Beweise/Proofs from the Book”
• Lecture “Introduction to the Asian board game Go”

Former Courses

Winter term 2023/24

• Lecture “Introduction to Theoretical Computer Science”

Summer term 2023

• Lecture “Quantum Complexity”
• Proseminar “Das Buch der Beweise/Proofs from the Book”

Winter term 2022/23

• Lecture “Introduction to Theoretical Computer Science”
• Lecture “Complexity Theory”

Summer term 2022

• Lecture “Competitive Programming”
• Lecture “Causality for complexity theorists”
• Doctoral privatissimum “The asymptotic spectrum of tensors”
  If you want to participate, send an email to Markus Bläser. It is highly recommended that you
  attended the lecture “Complexity of bilinear problems” last term.
• Proseminar “Das Buch der Beweise”

Winter Term 2021/2022

• Lecture “Grundzüge der Theoretischen Informatik”
• Lecture “Complexity of bilinear problems”
• Seminar “Complexity theory”
• Proseminar “Berechenbarkeits- und Komplexitätstheorie”

Summer Term 2021

• Lecture “Complexity Theory”
• Proseminar “Berechenbarkeits- und Komplexitätstheorie”

Winter Term 2020/2021

• Lecture “Grundzüge der Theoretischen Informatik”