Generic cospark of a matrix can be computed in polynomial time.

Sichen Zhong Yue Zhao

Published in: ISIT (2017)

Keyphrases

computational complexity
high level
special case
singular value decomposition
generic model
worst case
domain specific
linear combination
low rank
singular values
pseudo inverse
real time
learning algorithm
information systems
approximation algorithms