A note on the hardness of sparse approximation (Q2444766)
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 6282835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the hardness of sparse approximation |
scientific article; zbMATH DE number 6282835 |
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
0.8251058459281921
0 references
0.767874002456665
0 references
0.747139036655426
0 references
0.7388864159584045
0 references
