Sur la complexité d'un problème de codage (Q3755359)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sur la complexité d'un problème de codage |
scientific article; zbMATH DE number 4004068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sur la complexité d'un problème de codage |
scientific article; zbMATH DE number 4004068 |
Statements
Sur la complexité d'un problème de codage (English)
0 references
1987
0 references
binary linear code
0 references
NP-completeness
0 references
minimal weight codeword
0 references
0.8726117014884949
0 references
0.8681302070617676
0 references
0.8681302070617676
0 references
