On the reducibility of sets inside NP to sets with low information content (Q1765294)

From MaRDI portal
Revision as of 19:47, 9 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q161383)
scientific article
Language Label Description Also known as
English
On the reducibility of sets inside NP to sets with low information content
scientific article

    Statements

    On the reducibility of sets inside NP to sets with low information content (English)
    0 references
    0 references
    23 February 2005
    0 references
    Computational complexity
    0 references
    Selectivity
    0 references
    Membership comparability
    0 references
    Self-reduction
    0 references
    Sets with low information content
    0 references
    Prover-verifier protocols
    0 references

    Identifiers