Combinatorial PCPs with efficient verifiers (Q483706)
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 6381311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial PCPs with efficient verifiers |
scientific article; zbMATH DE number 6381311 |
Statements
Combinatorial PCPs with efficient verifiers (English)
0 references
17 December 2014
0 references
probabilistically checkable proofs
0 references
PCP of proximity
0 references
combinatorial PCP
0 references
0.8975388407707214
0 references
0.8286982178688049
0 references
0.8267748951911926
0 references
0.8267748951911926
0 references
0.8234009146690369
0 references
