Bounds on 2-query locally testable codes with affine tests (Q280942)
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 6578609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds on 2-query locally testable codes with affine tests |
scientific article; zbMATH DE number 6578609 |
Statements
Bounds on 2-query locally testable codes with affine tests (English)
0 references
10 May 2016
0 references
locally testable codes
0 references
unique games conjecture
0 references
computational complexity
0 references
theory of computation
0 references
0.8829668760299683
0 references
0.8187838196754456
0 references
0.8146457672119141
0 references
0.8099743723869324
0 references
0.804336667060852
0 references
