Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889)

From MaRDI portal
Revision as of 20:31, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
scientific article

    Statements

    Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    delegation of computation
    0 references
    probabilistically checkable proofs
    0 references
    random-access machines
    0 references
    succinct arguments
    0 references
    zero-knowledge proofs
    0 references
    0 references