Polynomial computability and NP-hardness conjecture for multiparameter persistence distances
Statement
Let be fixed, and let and denote the corresponding distances on finitely presented -parameter persistence modules, with considered specifically for -parameter modules. Computational complexity conjecture. (i) For fixed , the distance on finitely presented -parameter persistence modules is exactly computable in polynomial time. (ii) Computing on finitely presented -parameter persistence modules is NP-hard, for all . These computational claims concern the complexity of the distances whose approximation and computation are discussed in the paper; both assertions are left to future work.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.