2020 School: Lectures

The 2020 Caleidoscope school 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: Luca Trevisan, Bocconi University.
  3. Higher-Order Complexity. Lecturer: Bruce Kapron, University of Victoria.
  4. Parametrized Complexity. Lecturer: Daniel Marx, Max Planck Institute Saarbrucken.

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

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