Matrix sparsification and the sparse null space problem

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-83711

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.