The hardness of solving subset sum with preprocessing (Q5895284)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4176980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The hardness of solving subset sum with preprocessing |
scientific article; zbMATH DE number 4176980 |
Statements
The hardness of solving subset sum with preprocessing (English)
0 references
1990
0 references
normal code
0 references
subnormal code
0 references
amalgamated direct sum construction
0 references
covering radius
0 references
perfect code
0 references
lower bounds
0 references
ternary codes
0 references
