Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (Q2379685)
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: Short PCPPs verifiable in polylogarithmic time with O(1) queries |
scientific article; zbMATH DE number 5685229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries |
scientific article; zbMATH DE number 5685229 |
Statements
Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries (English)
0 references
19 March 2010
0 references
0.7770966291427612
0 references
0.7691309452056885
0 references
0.7650948166847229
0 references
