333 citations · 941 across the 18 of their papers we have counts for
1 paper · 1 filter
Nikos Vlassis
In this note we prove NP-hardness of the following problem: Given a set of matrices, is there a convex combination of those that is a nonsingular M-matrix? Via known characterizati…