We show that the Boolean, tropical, and t-norm versions of matrix factorization become polynomial time solvable when restricted to this class of matrices, and we also show that the nonnegative rank of a tridiagonal matrix is easy to compute. We recall several open problems from earlier papers ...
Nonnegative factorization15A2315B35We develop the technique useful for studying the problem of factoring nonnegative matrices. We illustrate our method, based on the tools from linear algebra over a semiring, by applying it to studying the problem of existence of a rank-three matrix with full ...
We prove the problem of determining tropical rank is NP-hard.doi:10.48550/arXiv.math/0501167Ki Hang KimFred W. RoushMathematicsK.H. Kim, F.W. Roush, Factorization of polynomials in one variable over the trop- ical semiring, arXiv:math.CO/0501167, 2005....