Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889): Difference between revisions
From MaRDI portal
Latest revision as of 04:01, 9 May 2025
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
0.8790032
0 references
0.8749603
0 references
0.8475303
0 references
0.84601057
0 references
0.84558874
0 references
0.83888125
0 references
0.8381044
0 references