Fixed-rank NP-hardness conjecture for nonnegative rank
Statement
For a nonnegative matrix , its nonnegative rank is the least inner dimension of a factorization of into two nonnegative matrices. The ordinary rank is the usual matrix rank. Fixed-rank NP-hardness conjecture. Computing and a corresponding nonnegative factorization is NP-hard when is fixed and at least , and possibly even when it is fixed at . The conjecture concerns the computational complexity of nonnegative rank at fixed ordinary rank; the source does not state that this problem has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.