The Computational Complexity of Multidimensional Persistence
Journal Article
·
· Proposed Journal Article, unpublished
OSTI ID:1429696
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Google, Inc., Mountain View, CA (United States)
We present findings on the computational complexity of computing multidimensional persistent homology. We first show that the worst-case computational complexity of multidimensional persistence is exponential. We then present an algorithm for computing multidimensional persistence which extends the algorithm given by Zomorodian and Carlsson for computing one-dimensional persistence. The computational complexity of our algorithm is polynomial in the size of the persistence module and exponential in the persistence dimension.
- Research Organization:
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1429696
- Report Number(s):
- SAND--2017-12740J; 659005
- Journal Information:
- Proposed Journal Article, unpublished, Journal Name: Proposed Journal Article, unpublished Vol. 2017; ISSN 9999-9999
- Publisher:
- See Research Organization
- Country of Publication:
- United States
- Language:
- English
Similar Records
Numeric invariants from multidimensional persistence
Numeric invariants from multidimensional persistence
Computational algebraic geometry for statistical modeling FY09Q2 progress.
Journal Article
·
Fri May 19 00:00:00 EDT 2017
· Journal of Applied and Computational Topology
·
OSTI ID:1361045
Numeric invariants from multidimensional persistence
Journal Article
·
Fri May 19 00:00:00 EDT 2017
· Journal of Applied and Computational Topology
·
OSTI ID:1335203
Computational algebraic geometry for statistical modeling FY09Q2 progress.
Technical Report
·
Sat Feb 28 23:00:00 EST 2009
·
OSTI ID:984161