69 citations · 162 across the 10 of their papers we have counts for
1 paper · 2 filters
Andreas M. Tillmann, Marc E. Pfetsch
This paper deals with the computational complexity of conditions which guarantee that the NP-hard problem of finding the sparsest solution to an underdetermined linear system can b…