A note on the hardness of sparse approximation (Q2444766): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2013.04.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2007457286
@@ Property / OpenAlex ID: W2007457286 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549682
@@ Property / cites work: Q3549682 / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptive greedy approximations
@@ Property / cites work: Adaptive greedy approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed sensing
@@ Property / cites work: Compressed sensing / rank @@
+Normal rank
@@ Property / cites work @@
+On Lebesgue-type inequalities for greedy approximation
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q4471300
@@ Property / cites work: Q4471300 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse Approximate Solutions to Linear Systems
@@ Property / cites work: Sparse Approximate Solutions to Linear Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
+Normal rank
@@ Property / cites work @@
+Weak greedy algorithms
@@ Property / cites work: Weak greedy algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Greed is Good: Algorithmic Results for Sparse Approximation
+Normal rank