Hardness of solving sparse overdetermined linear systems: a 3-query PCP over integers (Q2947543)
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 6485155
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of solving sparse overdetermined linear systems: a 3-query PCP over integers |
scientific article; zbMATH DE number 6485155 |
Statements
Hardness of Solving Sparse Overdetermined Linear Systems (English)
0 references
24 September 2015
0 references
hardness of approximation
0 references
linearity testing
0 references
probabilistically checkable proofs
0 references
sparse linear equations
0 references
0.8350273370742798
0 references
0.7749596238136292
0 references
0.7742499113082886
0 references
0.7465630769729614
0 references
0.7460945844650269
0 references
