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…