MathDB
Home
Tags
People
Discord
1 problem
Trending
Newest
Oldest
Votes
Filter
1
Post Problem
0
votes
0
replies
0
views
NP-hardness of SSymNMF-D
SSymNMF-D conjecture. The decision problem SSymNMF-D is NP-hard.
Conjecture
open
completely-positive-matrices
computational-complexity
symmetric-nmf
arXiv
posted
2 days ago
MathDB