Verifiable Computation and Succinct Arguments for NP (Q6111785)
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: Verifiable Computation and Succinct Arguments for NP |
scientific article; zbMATH DE number 7722690
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Verifiable Computation and Succinct Arguments for NP |
scientific article; zbMATH DE number 7722690 |
Statements
Verifiable Computation and Succinct Arguments for NP (English)
0 references
4 August 2023
0 references
polynomial-size arithmetic circuits
0 references
succinct non-interactive argument
0 references
