Pages that link to "Item:Q340554"
From MaRDI portal
The following pages link to Sparse approximation is provably hard under coherent dictionaries (Q340554):
Displaying 5 items.
- On some deterministic dictionaries supporting sparsity (Q734953) (← links)
- NP-hardness and inapproximability of sparse PCA (Q2361497) (← links)
- A note on the hardness of sparse approximation (Q2444766) (← links)
- Average Performance of the Sparsest Approximation Using a General Dictionary (Q3173502) (← links)
- (Q4471300) (← links)