2023 School: Lectures

The school consisted of 6 courses, on the following topics:

  1. Descriptive Complexity (Albert Atserias, Universitat Politècnica de Catalunya)
  2. Randomness (Valentine Kabanets, Simon Fraser University)
  3. Lower Bounds (Paul Beame, University of Washington)
  4. Hardness of Approximation (Irit Dinur, Weizmann Institute)
  5. Parameterized Algorithms and Fine-Grained Complexity (Michał Pilipczuk, University of Warsaw)
  6. Algebraic and Geometric Complexity (Guillaume Malod, IMJ, and Christian Ikenmeyer, University of Warwick)

The typical course comprised three 90-minute lectures, and the program included time for discussions.