Sparse approximation is provably hard under coherent dictionaries (Q340554): Difference between revisions

@@ Property / OpenAlex ID @@
+W2491631217
@@ Property / OpenAlex ID: W2491631217 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02885
@@ Property / arXiv ID: 1702.02885 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Compressed sensing with coherent and redundant dictionaries
+Normal rank
@@ Property / cites work @@
+Column subset selection problem is UG-hard
@@ Property / cites work: Column subset selection problem is UG-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential inapproximability of selecting a maximum volume sub-matrix
+Normal rank
@@ Property / cites work @@
+Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
+Normal rank
@@ Property / cites work @@
+Adaptive greedy approximations
@@ Property / cites work: Adaptive greedy approximations / 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 @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
+Normal rank
@@ Property / cites work @@
+The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
+Normal rank
@@ Property / cites work @@
+On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+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 @@
+A Parallel Repetition Theorem
@@ Property / cites work: A Parallel Repetition Theorem / 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 @@
+On performance of greedy algorithms
@@ Property / cites work: On performance of greedy algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Greed is Good: Algorithmic Results for Sparse Approximation
+Normal rank