Learning Trees of ${\ell }_0$-Minimization Problems

G. Welper

The problem of computing minimally sparse solutions of under-determined linear systems is $NP$ hard in general. Subsets with extra properties, may allow efficient algorithms, most…