Short PCPs with Polylog Query Complexity (Q3624377): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/050646445 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087900794 / rank | |||
Normal rank | |||
Latest revision as of 21:36, 19 March 2024
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
