A Parallel Algorithm for the Knapsack Problem (Q3309063)

From MaRDI portal
Revision as of 10:38, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Parallel Algorithm for the Knapsack Problem
scientific article

    Statements

    title
    A Parallel Algorithm for the Knapsack Problem (English)
    0 references
    author
    Ehud D. Karnin
    0 references
    publication date
    1984
    0 references
    zbMATH Keywords
    cryptography
    0 references
    knapsack problem
    0 references
    parallel architecture
    0 references
    time-memory- processor tradeoff
    0 references
    VLSI complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    90C10
    0 references
    68N25
    0 references
    zbMATH DE Number
    3839317
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3309063&oldid=27668461"
    Powered by MediaWiki