Constant rate PCPs for circuit-SAT with sublinear query complexity (Q3177809)
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 6912644
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant rate PCPs for circuit-SAT with sublinear query complexity |
scientific article; zbMATH DE number 6912644 |
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
0.8628451824188232
0 references
0.8598573207855225
0 references
0.8550825119018555
0 references
0.8531724810600281
0 references
0.8377844095230103
0 references
