Séminaire Algorithmique : Geoffroy Caillat-Grenier (LIRMM, Univ. Montpellier), « From combinatorics of graphs to communication complexity in algorithmic information theory »

Sciences 3- S3 351

Several connexions between information theory and combinatorics of graphs have been explored in the last decades. Following this path, we use tools from spectral graph theory to show impossibility results … Continue reading Séminaire Algorithmique : Geoffroy Caillat-Grenier (LIRMM, Univ. Montpellier), « From combinatorics of graphs to communication complexity in algorithmic information theory »