The hardness of solving subset sum with preprocessing (Q5895284): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/18.53763 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042339194 / rank | |||
Normal rank | |||
Latest revision as of 21:50, 19 March 2024
scientific article; zbMATH DE number 4176980
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
