Sparse approximation is provably hard under coherent dictionaries (Q340554)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sparse approximation is provably hard under coherent dictionaries |
scientific article; zbMATH DE number 6652737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparse approximation is provably hard under coherent dictionaries |
scientific article; zbMATH DE number 6652737 |
Statements
Sparse approximation is provably hard under coherent dictionaries (English)
0 references
14 November 2016
0 references
sparse approximation
0 references
complexity
0 references
PCP
0 references
unique games
0 references
0.8251058459281921
0 references
0.7815181612968445
0 references
0.7634662985801697
0 references
0.7213426828384399
0 references
