Short PCPs with Polylog Query Complexity (Q3624377)
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 PCPs with Polylog Query Complexity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Short PCPs with Polylog Query Complexity |
scientific article |
Statements
Short PCPs with Polylog Query Complexity (English)
0 references
30 April 2009
0 references
probabilistically checkable proofs
0 references
PCPs of proximity
0 references
locally testable codes
0 references
Reed-Solomon codes
0 references
