Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 21, Number 1, 1987
Page(s) 25 - 32
DOI https://doi.org/10.1051/ita/1987210100251
Published online 01 February 2017
  1. 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. 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. 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. 4. R. L. GRAHAM, Communication personnelle.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.