Sparse approximation is provably hard under coherent dictionaries (Q340554): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1034597 |
||
| Property / author | |||
| Property / author: Ali Çivril / rank | |||
Revision as of 01:40, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparse approximation is provably hard under coherent dictionaries |
scientific article |
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
