Matrix sparsification and the sparse null space problem
Computational Complexity
2010-08-10 v1 Numerical Analysis
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.
Cite
@article{arxiv.1008.1498,
title = {Matrix sparsification and the sparse null space problem},
author = {Lee-Ad Gottlieb and Tyler Neylon},
journal= {arXiv preprint arXiv:1008.1498},
year = {2010}
}
Comments
A preliminary version appeared in Approx '10