Login / Signup
Self-Witnessing Polynomial-Time Complexity and Prime Factorization.
Michael R. Fellows
Neal Koblitz
Published in:
Computational Complexity Conference (1992)
Keyphrases
</>
polynomial time complexity
np complete
matrix factorization
min cut max flow
singular value decomposition
tensor factorization
factorization method
kronecker product
pairwise
non rigid structure from motion
computational complexity
np hard
collaborative filtering
higher order
graphical models
sparse matrices