It is proved in this paper that to every underdetermined linear system Ax = b there corresponds a constant p(A, b) > 0 such that every solution to the lp-norm minimization problem also solves the l0-norm minimization problem whenever 0 < p < p(A, b). This phenomenon is named NP/CLP equivalence.
