Blar i Institutt for matematiske fag på tidsskrift "Leibniz International Proceedings in Informatics"
Viser treff 1-1 av 1
-
Computational Complexity of the Interleaving Distance
(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 ...