2021 School: Lectures

The 2021 Caleidoscope school was cancelled before the full programme was determined. It was planned to be comprised of four main lecture courses, based on some of the most developed approaches to computational complexity today.

  1. Algorithms and lower bounds. Lecturer: Ryan Williams, MIT.
  2. Hardness of Approximation. Lecturer: Irit Dinur, The Weizmann Institute of Science.
  3. Higher-Order Complexity. Lecturer: Bruce Kapron, University of Victoria.
  4. TBA

In addition to these broad-ranging themes, lectures on three more focussed topics were planned.

  1. Static Complexity Analysis. Lecturer: Georg Moser, University of Innsbruck.
  2. Complexity Theory for Black-Box Optimization Heuristics. Lecturer: Carola Doerr, CNRS and Sorbonne University.
  3. TBA