Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur Graph Search.
We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search problems (TFNP) as a unifying language for these connections and discuss how this perspective suggests a whole programme for further research.
Mika Tapani Göös, Siddhartha Jain
Colin Neil Jones, Yuning Jiang, Yingzhao Lian, Xinliang Dai
Negar Kiyavash, Sina Akbari, Seyed Jalal Etesami