|
09:00 - 10:00
|
Complexity Theory for Real-World Computation (Amphi Pierre-Gilles de Gennes) - Jakob Nordström |
|
|
10:00 - 10:30
|
Coffee break |
|
|
10:30 - 11:00
|
Enumeration complexity and regularization (Amphi Pierre-Gilles de Gennes) - Yann Strozecki |
|
|
11:00 - 11:30
|
Triple mutual information: combinatorial and communication perspectives (Amphi Pierre-Gilles de Gennes) - Andrei Romaschenko |
|
|
11:30 - 12:00
|
Scheduling meets parameterized complexity (Amphi Pierre-Gilles de Gennes) - Maher Mallem |
|
|
12:00 - 14:00
|
Lunch (Restaurant Buffon) |
|
|
14:00 - 15:00
|
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits : An overview (Amphi Pierre-Gilles de Gennes) - Sébastien Tavenas |
|
|
15:00 - 15:30
|
Coffee break |
|
|
15:30 - 16:00
|
Specification and Automatic Verification of Computational Reductions (Amphi Pierre-Gilles de Gennes) - Julien Grange |
|
|
16:00 - 16:20
|
Characterisations of polynomial-time and -space complexity classes over the reals (Amphi Pierre-Gilles de Gennes) - Manon Blanc |
|
|
16:20 - 16:40
|
Coming up with new solutions independently : A simple to state but hard to solve combinatorial problem with links to time bounded Kolmogorov complexity (Amphi Pierre-Gilles de Gennes) - Ulysse Léchine |
|
|
16:40 - 17:00
|
Closing discussion (Amphi Pierre-Gilles de Gennes) |
|
