|
13-14 Dec 2023 Paris (France)
|
Program
 |
‹ Thursday, December 14, 2023 |
|
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
17:00
|
›9:00 (1h)
› Amphi Pierre-Gilles de Gennes
9:00 - 10:00 (1h)
Complexity Theory for Real-World Computation
 Amphi Pierre-Gilles de Gennes
Jakob Nordström
›10:00 (30min)
10:00 - 10:30 (30min)
Coffee break
›10:30 (30min)
› Amphi Pierre-Gilles de Gennes
10:30 - 11:00 (30min)
Enumeration complexity and regularization
Amphi Pierre-Gilles de Gennes
Yann Strozecki
›11:00 (30min)
› Amphi Pierre-Gilles de Gennes
11:00 - 11:30 (30min)
Triple mutual information: combinatorial and communication perspectives
Amphi Pierre-Gilles de Gennes
Andrei Romaschenko
›11:30 (30min)
› Amphi Pierre-Gilles de Gennes
11:30 - 12:00 (30min)
Scheduling meets parameterized complexity
Amphi Pierre-Gilles de Gennes
Maher Mallem
›12:00 (2h)
12:00 - 14:00 (2h)
Lunch (Restaurant Buffon)
›14:00 (1h)
› Amphi Pierre-Gilles de Gennes
14:00 - 15:00 (1h)
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits : An overview
Amphi Pierre-Gilles de Gennes
Sébastien Tavenas
›15:00 (30min)
15:00 - 15:30 (30min)
Coffee break
›15:30 (30min)
› Amphi Pierre-Gilles de Gennes
15:30 - 16:00 (30min)
Specification and Automatic Verification of Computational Reductions
Amphi Pierre-Gilles de Gennes
Julien Grange
›16:00 (20min)
› Amphi Pierre-Gilles de Gennes
16:00 - 16:20 (20min)
Characterisations of polynomial-time and -space complexity classes over the reals
Amphi Pierre-Gilles de Gennes
Manon Blanc
›16:20 (20min)
› Amphi Pierre-Gilles de Gennes
16:20 - 16:40 (20min)
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 (20min)
Closing discussion
Amphi Pierre-Gilles de Gennes
|
| Session | Speech | Logistics | Break | Tour |
| Online user: 3 | Privacy |
|
