dc.contributor.advisor | Quick, Gereon | |
dc.contributor.advisor | Baas, Nils | |
dc.contributor.author | Bjerkevik, Håvard Bakke | |
dc.date.accessioned | 2020-06-04T09:21:06Z | |
dc.date.available | 2020-06-04T09:21:06Z | |
dc.date.issued | 2020 | |
dc.identifier.isbn | 978-82-326-4719-4 | |
dc.identifier.issn | 1503-8181 | |
dc.identifier.uri | https://hdl.handle.net/11250/2656497 | |
dc.language.iso | eng | en_US |
dc.publisher | NTNU | en_US |
dc.relation.ispartofseries | Doctoral theses at NTNU;2020:185 | |
dc.relation.haspart | Paper 1: Bakke Bjerkevik, Håvard. Stability of Interval Decomposable Persistence Modules.
https://arxiv.org/abs/1609.02086 | en_US |
dc.relation.haspart | Paper 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 | en_US |
dc.relation.haspart | 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 | en_US |
dc.title | Stability and Complexity in Multi-Parameter Persistence | en_US |
dc.type | Doctoral thesis | en_US |
dc.subject.nsi | VDP::Mathematics and natural science: 400::Mathematics: 410 | en_US |