5 citations · 5 across the 2 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
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 -interlea…
math.RT2018
Decomposition of persistence modules
Magnus Bakke Botnan, William Crawley-Boevey
We show that a pointwise finite-dimensional persistence module indexed over a small category decomposes into a direct sum of indecomposables with local endomorphism rings. As an ap…