Generic Cospark of a Matrix Can Be Computed in Polynomial Time.

Sichen Zhong Yue Zhao

Published in: CoRR (2017)

Keyphrases

special case
computational complexity
positive definite
worst case
linear algebra
finds an optimal solution
data mining
machine learning
knowledge base
high level
high dimensional
upper bound
domain specific
approximation algorithms
similarity matrix
sparse matrix