Sur la complexité d'un problème de codage
Lobstein, Antoine ; Cohen, Gérard
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987), p. 25-32 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1987-01-01
@article{ITA_1987__21_1_25_0,
     author = {Lobstein, Antoine and Cohen, G\'erard},
     title = {Sur la complexit\'e d'un probl\`eme de codage},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {21},
     year = {1987},
     pages = {25-32},
     mrnumber = {882868},
     zbl = {0618.94012},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1987__21_1_25_0}
}

Lobstein, Antoine; Cohen, Gérard. Sur la complexité d'un problème de codage. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) pp. 25-32. http://gdmltest.u-ga.fr/item/ITA_1987__21_1_25_0/

1. E. R. Berlekamp, R. J. Maceliece et H. C. A. Van Tilborg, On the Inherent Intractability of Certain Coding Problems, I.E.E.E. Trans, on Information Theory, vol. IT-24, n° 3, mai 1978. | MR 495180 | Zbl 0377.94018

2. M. R. Garey et D. S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1978. | MR 519066 | Zbl 0411.68039

3. S. C. Intafos et S. L. Hakimi, On the Complexity of Some Coding Problems, I.E.E.E. Trans. on Information Theory, vol. IT-27, n° 6, novembre 1981. | MR 650720 | Zbl 0465.94021

4. R. L. Graham, Communication personnelle.