The hardness of solving subset sum with preprocessing (Q5895284)

From MaRDI portal
Revision as of 13:09, 8 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references