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

From MaRDI portal
Revision as of 21:25, 26 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29543805, #quickstatements; #temporary_batch_1706300061798)
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
    0 references