Stability and Complexity in Multi-Parameter Persistence
Has parts
Paper 1: Bakke Bjerkevik, Håvard. Stability of Interval Decomposable Persistence Modules. https://arxiv.org/abs/1609.02086Paper 2: Bjerkevik, Håvard Bakke; Botnan, Magnus Bakke. Computational Complexity of the Interleaving Distance. Leibniz International Proceedings in Informatics 2018 ;Volum 99. s. 13:1-13:15 https://doi.org/10.4230/LIPIcs.SoCG.2018.13 Related fulltext version https://arxiv.org/abs/1712.04281 Open Access licensed under Creative Commons License CC-BY
Paper 3: Bjerkevik, Håvard Bakke; Botnan, Magnus Bakke; Kerber, Michael. Computing the Interleaving Distance is NP-Hard. Foundations of Computational Mathematics 2019 https://doi.org/10.1007/s10208-019-09442-y This article is distributed under the terms of the Creative Commons Attribution 4.0 Interna-tional License (http://creativecommons.org/licenses/by/4.0/) CC BY 4.0