Combinatorial PCPs with efficient verifiers (Q483706): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6381311 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
probabilistically checkable proofs | |||
| Property / zbMATH Keywords: probabilistically checkable proofs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
PCP of proximity | |||
| Property / zbMATH Keywords: PCP of proximity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
combinatorial PCP | |||
| Property / zbMATH Keywords: combinatorial PCP / rank | |||
Normal rank | |||
Revision as of 19:58, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial PCPs with efficient verifiers |
scientific article |
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
