Lattice-based succinct arguments for NP with polylogarithmic-time verification (Q6145785)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7799223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lattice-based succinct arguments for NP with polylogarithmic-time verification |
scientific article; zbMATH DE number 7799223 |
Statements
Lattice-based succinct arguments for NP with polylogarithmic-time verification (English)
0 references
2 February 2024
0 references
succinct arguments
0 references
lattices
0 references
short-integer-solution problem
0 references
0 references
0 references
0 references
0 references
0 references
0.8569966554641724
0 references
0.8270795941352844
0 references
0.8114404082298279
0 references
0.8087021708488464
0 references
0.7887755632400513
0 references
