Research school in computational complexity. 15-19 June 2020, Paris.

Program

Monday, June 15, 2020 ›
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
17:00
›9:00 (1h30)
Hardness of Approximation 1
Luca Trevisan
› Salle des thèses
›10:30 (30min)
Coffee break
›11:00 (1h30)
Algorithms and Lower Bounds 1
Ryan Willams
› Salle des thèses
›12:30 (1h30)
Lunch
›14:00 (2h)
Hardness of Approximation 2
Luca Trevisan
› Salle des thèses
›16:00 (30min)
Coffee break
›16:30 (1h)
Static Complexity Analysis 1
Georg Moser
› Salle des thèses
Session
Speech
Logistics
Break
Tour
Online user: 1 Privacy
Loading...