Computing NP-Hardness of p-Presentation Distances in Merge Trees and Persistence Modules

The authors demonstrate the NP-hardness of computing p-presentation distances for merge trees and t-parameter persistence modules, providing a novel strategy applicable to various settings in topological data analysis.