Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033): Difference between revisions

@@ Property / cites work @@
+On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
+Normal rank
@@ Property / cites work @@
+A competitive algorithm in searching for many edges in a hypergraph
+Normal rank
@@ Property / cites work @@
+Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
+Normal rank
@@ Property / cites work @@
+The union of minimal hitting sets: parameterized combinatorial bounds and counting
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Sparse nonnegative solution of underdetermined linear equations by linear programming
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for \(d\)-hitting set: the weighted case
+Normal rank
@@ Property / cites work @@
+A top-down approach to search-trees: Improved algorithmics for 3-hitting set
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A group testing problem for graphs with several defective edges
+Normal rank
@@ Property / cites work @@
+Q3560376
@@ Property / cites work: Q3560376 / 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 @@
+An efficient fixed-parameter algorithm for 3-hitting set
+Normal rank
@@ Property / cites work @@
+A group testing problem for hypergraphs of bounded rank
+Normal rank
@@ Property / cites work @@
+A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
+Normal rank