Wednesday, December 13, 2023

Time Event (+)
13:30 - 13:50 Arrival and coffee  
13:50 - 14:00 Opening remarks (Amphi Turing)  
14:00 - 15:00 Certificate games (Amphi Turing) - Sophie Laplante  
15:00 - 15:30 Coffee break  
15:30 - 16:30 The Descriptive Complexity of Graph Neural Networks (Amphi Turing) - Martin Grohe  
16:30 - 16:45 Break  
16:45 - 17:15 Implicit characterization of the class of Basic Feasible Functionals (Amphi Turing) - Romain Péchoux  
17:15 - 17:40 Characterization of complexity classes using categorical logic (Amphi Turing) - Baptiste Chanus  
17:40 - 18:00 The expressive power of low descriptive complexity invariants (Amphi Turing) - Djamel Amir  
19:45 - 22:00 Dinner (Restaurant Bouillon Racine)  

Thursday, December 14, 2023

Time Event (+)
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)