Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Add wikidata reference. |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130970249 / rank | |||
Normal rank | |||
Revision as of 10:13, 16 December 2024
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
