Technical Program

Session Detail

Session Title TH4.R9: Computational Complexity
Session Time Thursday, 11 July, 16:40 - 18:00
Location Pontoise, Level 5
Session ChairAbram Magner, University of Michigan

TH4.R9.1: On the Computational Complexity of Blind Detection of Binary Linear Codes
 Click here to download the manuscript
         Alexios Balatsoukas-Stimming; École polytechnique fédérale de Lausanne (EPFL)
         Aris Filos-Ratsikas; École polytechnique fédérale de Lausanne (EPFL)

TH4.R9.2: Complexity and Similarity for Sequences using LZ77-based conditional information measure
 Click here to download the manuscript
         François Cayre; Univ. Grenoble Alpes, CNRS, Grenoble INP, GIPSA-Lab,
         Nicolas Le Bihan; Univ. Grenoble Alpes, CNRS, Grenoble INP, GIPSA-Lab,

TH4.R9.3: On the Algorithmic Solvability of the Spectral Factorization and the Calculation of the Wiener Filter on Turing Machines
 Click here to download the manuscript
         Holger Boche; Technische Universität München
         Volker Pohl; Technische Universität München

TH4.R9.4: Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial
 Click here to download the manuscript
         Magali Bardet; LITIS, University of Rouen Normandie
         Ayoub Otmani; LITIS, University of Rouen Normandie
         Mohamed Saeed-Taha; University of Khartoum