On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank.
Herbert EdelsbrunnerSalman ParsaPublished in: SODA (2014)
Keyphrases
- betti numbers
- computational complexity
- singular values
- nuclear norm minimization
- np complete
- topological features
- computational cost
- singular value decomposition
- high computational complexity
- special case
- np hard
- decision problems
- computational efficiency
- covariance matrix
- low complexity
- object detection
- memory requirements
- linear algebra
- matrix representation
- machine learning