Computational Complexity of the Interleaving Distance
From MaRDI portal
Publication:5115780
DOI10.4230/LIPIcs.SoCG.2018.13zbMath1489.68103arXiv1712.04281MaRDI QIDQ5115780
Håvard Bakke Bjerkevik, Magnus Bakke Botnan
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/abs/1712.04281
Analysis of algorithms and problem complexity (68Q25) Persistent homology and applications, topological data analysis (55N31) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (13)
Multiparameter Persistence Landscapes ⋮ Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics ⋮ Analysis of Dynamic Graphs and Dynamic Metric Spaces via Zigzag Persistence ⋮ Computing the interleaving distance is NP-hard ⋮ Spatiotemporal persistent homology for dynamic metric spaces ⋮ Computational Complexity of the Interleaving Distance ⋮ On the stability of interval decomposable persistence modules ⋮ Unnamed Item ⋮ On the geometrical properties of the coherent matching distance in 2D persistent homology ⋮ A brief introduction to multidimensional persistent Betti numbers ⋮ Topological spaces of persistence modules and their properties ⋮ Generalized persistence algorithm for decomposing multiparameter persistence modules ⋮ Computing Minimal Presentations and Bigraded Betti Numbers of 2-Parameter Persistent Homology
Cites Work
- Unnamed Item
- Metrics for generalized persistence modules
- Testing isomorphism of modules.
- The theory of multidimensional persistence
- Algebraic stability of zigzag persistence modules
- Multidimensional persistence and noise
- Zigzag persistence
- On the stability of interval decomposable persistence modules
- Categorification of persistent homology
- Decomposition of exact pfd persistence bimodules
- The theory of the interleaving distance on multidimensional persistence modules
- Induced Matchings and the Algebraic Stability of Persistence Barcodes
- Introduction to the Representation Theory of Algebras
- Computing the Gromov-Hausdorff Distance for Metric Trees
- Decomposition of Graded Modules
- Geometry Helps to Compare Persistence Diagrams
- Decomposition of pointwise finite-dimensional persistence modules
- Computational Complexity of the Interleaving Distance
- Interval decomposition of infinite zigzag persistence modules
- Higher Interpolation and Extension for Persistence Modules
- Proximity of persistence modules and their diagrams
- Zigzag persistent homology and real-valued functions
- Zigzag persistent homology in matrix multiplication time
- Corrections and Supplementaries to My Paper concerning Krull-Remak-Schmidt’s Theorem
This page was built for publication: Computational Complexity of the Interleaving Distance
