Navigation Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 par Discipline "Informatique [cs]/Complexité [cs.CC]"
Voici les éléments 1-6 de 6
-
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
(IEEE Transactions on Information Theory. vol. 65, n° 12, pp. 7697-7717, 2019-12)Article de revue -
On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
(IEEE Transactions on Information Theory, 2016-10-10)Article de revue -
An empirical study of functional complexity as an indicator of overfitting in Genetic Programming
Communication dans un congrès -
The complexity of class polynomial computation via floating point approximations
(Mathematics of Computation. vol. 78, n° 266, pp. 1089-1107, 2009)Article de revue -
Computing modular polynomials in quasi-linear time
(Mathematics of Computation. vol. 78, n° 267, pp. 1809-1824, 2009)Article de revue