A note on the hardness of sparse approximation (Q2444766): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.04.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2007457286 / rank | |||
Normal rank | |||
Revision as of 18:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the hardness of sparse approximation |
scientific article |
Statements
A note on the hardness of sparse approximation (English)
0 references
11 April 2014
0 references
approximation algorithms
0 references
computational complexity
0 references
sparse approximation
0 references
subset selection
0 references
complexity
0 references
inapproximability
0 references
