The complexity of promise problems with applications to public-key cryptography (Q3722415)

From MaRDI portal
Revision as of 11:47, 18 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
The complexity of promise problems with applications to public-key cryptography
scientific article

    Statements

    The complexity of promise problems with applications to public-key cryptography (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    partial decision problem
    0 references
    Turing reducibility
    0 references
    NP-hard cracking problems
    0 references
    NP-complete sets
    0 references
    Turing machines
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references