Computer Science – Computational Complexity
Scientific paper
2010-08-09
Computer Science
Computational Complexity
A preliminary version appeared in Approx '10
Scientific paper
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.
Gottlieb Lee-Ad
Neylon Tyler
No associations
LandOfFree
Matrix sparsification and the sparse null space problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Matrix sparsification and the sparse null space problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matrix sparsification and the sparse null space problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-83711