Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669): Difference between revisions

@@ 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 @@
+Near Optimal Column-Based Matrix Reconstruction
@@ Property / cites work: Near Optimal Column-Based Matrix Reconstruction / rank @@
+Normal rank
@@ Property / cites work @@
+Rang revealing QR factorizations
@@ Property / cites work: Rang revealing QR factorizations / rank @@
+Normal rank
@@ Property / cites work @@
+Low‐rank revealing QR factorizations
@@ Property / cites work: Low‐rank revealing QR factorizations / rank @@
+Normal rank
@@ Property / cites work @@
+On Rank-Revealing Factorisations
@@ Property / cites work: On Rank-Revealing Factorisations / rank @@
+Normal rank
@@ Property / cites work @@
+On selecting a maximum volume sub-matrix of a matrix and related problems
+Normal rank
@@ Property / cites work @@
+Subset selection for matrices
@@ Property / cites work: Subset selection for matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002774
@@ Property / cites work: Q3002774 / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptive Sampling and Fast Low-Rank Matrix Approximation
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q5689624
@@ Property / cites work: Q5689624 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784645
@@ Property / cites work: Q2784645 / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudo-skeleton approximations by matrices of maximal volume
+Normal rank
@@ Property / cites work @@
+Largest \(j\)-simplices in \(n\)-polytopes
@@ Property / cites work: Largest \(j\)-simplices in \(n\)-polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating \(k\)-set packing
+Normal rank
@@ Property / cites work @@
+Rank-Revealing QR Factorizations and the Singular Value Decomposition
+Normal rank
@@ Property / cites work @@
+Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope
+Normal rank
@@ Property / cites work @@
+Polynomial-time approximation of largest simplices in \(V\)-polytopes.
+Normal rank
@@ Property / cites work @@
+On the existence and computation of rank-revealing LU factorizations
+Normal rank
@@ Property / cites work @@
+Bounds on singular values revealed by QR factorizations
+Normal rank
@@ Property / cites work @@
+A Parallel Repetition Theorem
@@ Property / cites work: A Parallel Repetition Theorem / rank @@
+Normal rank