COURSES

Lance Fortnow (Northwestern University, Toyota Technological Institute):

Structural Complexity
Nicola Galesi (University of Rome "La Sapienza"):

Proof Complexity
Heribert Vollmer (University of Hanover):

Satisfiability Problems
Uri Zwick (Tel Aviv University):

Complexity of Graph Algorithms Based on Matrix Multiplication

CALL FOR PARTICIPATION