Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast reductions from RAMs to delegatable succinct constraint satisfaction problems |
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
16 May 2017
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
