« Theory and mathematics of computing » Axe (TMC)

Teams : ALMASTY, ALSOC, APR, ComplexNetworks, DECISION, MoVe, NPA, PEQUAN, PolSys, QI, RO, SYEL.

Co-animateurs :

Bruno Escoffier Campus Pierre et Marie Curie 26-00/419
Nathalie Sznajder Campus Pierre et Marie Curie 25-26/216

Short presentation

Decidability and complexity issues as well as mathematical and discrete models and algorithms are ubiquitous in computer science, such as formal semantics for modeling systems, behavior of large software components, community detection through graph algorithms, mathematics for discrete/continuous optimization, and scientific computing in a broad sense. We provide algorithms to optimize computer systems, for decision making, to increase the reliability of computing software and/or to assess the security of cryptographic primitives and prepare the quantum era. Most of them suffer from the curse of dimensionality and our goal is to push forward the current barriers.

No event planned at present.