Cryptocomplexity and NP-completeness (Q3888962)

From MaRDI portal
Revision as of 08:58, 20 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Cryptocomplexity and NP-completeness
scientific article

    Statements

    title
    Cryptocomplexity and NP-completeness (English)
    0 references
    author
    Shimon Even
    0 references
    Yacov Yacobi
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    cryptocomplexity
    0 references
    NP-completeness
    0 references
    cryptosystems
    0 references
    knapsack problem
    0 references
    NP-hardness
    0 references
    cracking problem
    0 references

    Identifiers

    zbMATH DE Number
    3695078
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3888962&oldid=8318697"
      Powered by MediaWiki