Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity (Q3177809): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:56, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity |
scientific article |
Statements
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity (English)
0 references
2 August 2018
0 references
PCPs
0 references
probabilistically checkable proofs
0 references
algebraic-geometric codes
0 references
error-correcting codes
0 references
probabilistic proof systems
0 references
sublinear time algorithms
0 references
