Matrix sparsification and the sparse null space problem
classification
💻 cs.CC
cs.NAmath.NA
keywords
problemsmatrixsparsealgorithmsapproximationnullspacesparsification
read the original abstract
We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a powerful tool to extend algorithms and heuristics for sparse approximation theory to these problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.