Towards a Theory for Typical-Case Algorithmic Hardness

Workshop
January 27, 2025 - February 7, 2025
The workshop will cover typical-case algorithmic hardness, with a special focus on creating bridges between the complementary approaches of theoretical computer science and statistical physics, identifying the crucial open question in the field and linking rigorous and non-rigorous methods. We will have a set of in-depth lectures, many seminars covering state-of-the-art advances, a poster session and plenty of discussion time.
This session is organized by:
Bruno LOUREIRO (DI-ENS & CNRS), Département d’Informatique - École Normale Supérieure
Vittorio ERBA (EPFL), Statistical Physics of Computation Laboratory  - EPFL Lausanne

More information can be found on the session's website.
Published on  September 4, 2024
Updated on  September 4, 2024