Vis enkel innførsel

dc.contributor.advisorQuick, Gereon
dc.contributor.advisorBaas, Nils
dc.contributor.authorBjerkevik, Håvard Bakke
dc.date.accessioned2020-06-04T09:21:06Z
dc.date.available2020-06-04T09:21:06Z
dc.date.issued2020
dc.identifier.isbn978-82-326-4719-4
dc.identifier.issn1503-8181
dc.identifier.urihttps://hdl.handle.net/11250/2656497
dc.language.isoengen_US
dc.publisherNTNUen_US
dc.relation.ispartofseriesDoctoral theses at NTNU;2020:185
dc.relation.haspartPaper 1: Bakke Bjerkevik, Håvard. Stability of Interval Decomposable Persistence Modules. https://arxiv.org/abs/1609.02086en_US
dc.relation.haspartPaper 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-BYen_US
dc.relation.haspartPaper 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.0en_US
dc.titleStability and Complexity in Multi-Parameter Persistenceen_US
dc.typeDoctoral thesisen_US
dc.subject.nsiVDP::Mathematics and natural science: 400::Mathematics: 410en_US


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel