• Computational Complexity of the Interleaving Distance 

      Bjerkevik, Håvard Bakke; Botnan, Magnus Bakke (Journal article; Peer reviewed, 2018)
      The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several ...
    • Computing the Interleaving Distance is NP-Hard 

      Bjerkevik, Håvard Bakke; Botnan, Magnus Bakke; Kerber, Michael (Journal article; Peer reviewed, 2019)
      We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are 1-interleaved is NP-complete, already for bigraded, ...
    • Stability and Complexity in Multi-Parameter Persistence 

      Bjerkevik, Håvard Bakke (Doctoral theses at NTNU;2020:185, Doctoral thesis, 2020)
    • Stability of Persistence Modules 

      Bjerkevik, Håvard Bakke (Master thesis, 2016)
      We present a new proof of the algebraic stability theorem, perhaps the main theorem in the theory of stability of persistent homology. We also give an example showing that an analogous result does not hold for a certain ...