Saarland University
Department of Computer Science
Computational Complexity
Computational Complexity

Publications

Teaching

Workshops

Algebraic complexity theory

Prof. Dr. Markus Bläser

Topic

We will try to understand recent developments in lower bounds for aritthmetic circuits, in particular current upper and lower bounds for depth-4 and depth-3 circuits.

Papers to read:

Time & Date

  • Thursdays, 12:15 to 14:00
  • First meeting: May 2
  • Lecturer