REVIEW 1 cited by
The nonnegative rank of a matrix: Hard problems, easy solutions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Using elementary linear algebra, we develop a technique that leads to solutions of two widely known problems on nonnegative matrices. First, we give a short proof of the result by Vavasis stating that the nonnegative rank of a matrix is NP-hard to compute. This proof is essentially contained in the paper by Jiang and Ravikumar, who discussed this topic in different terms fifteen years before the work of Vavasis. Secondly, we present a solution of the problem of Cohen and Rothblum on rational nonnegative factorizations, which was posed in 1993 and remained open.
Forward citations
Cited by 1 Pith paper
-
Optimal Curve Straightening is $\exists\mathbb{R}$-Complete
Optimal curve straightening to a target vertex count is ∃R-complete, and isotopy realization spaces of curves are universal up to homotopy equivalence.
Discussion (0). Continue with ORCID to comment.