Håvard Bakke Bjerkevik

activity

20162024

most citedStability of higher-dimensional interval decomposable persistence modules

27 citations · 35 across the 5 of their papers we have counts for

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2024

Computing $p$ -presentation distances is hard

Håvard Bakke Bjerkevik, Magnus Bakke Botnan

Recently, $p$ -presentation distances for $p \in [1, \infty]$ were introduced for merge trees and multiparameter persistence modules as more sensitive variations of the respective int…

cs.CG2018

Computing the interleaving distance is NP-hard

Håvard Bakke Bjerkevik, Magnus Bakke Botnan, Michael Kerber

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$ -interlea…

cs.CG2017

Computational Complexity of the Interleaving Distance

Håvard Bakke Bjerkevik, Magnus Bakke Botnan

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 determin…

Computing p-presentation distances is hard

Computing the interleaving distance is NP-hard

Computational Complexity of the Interleaving Distance

Computing $p$ -presentation distances is hard