Computing the interleaving distance is NP-hard.
Håvard Bakke BjerkevikMagnus Bakke BotnanMichael KerberPublished in: CoRR (2018)
Keyphrases
- np hard
- distance measure
- minimum cost
- optimal solution
- scheduling problem
- special case
- np hardness
- linear programming
- lower bound
- distance function
- euclidean distance
- approximation algorithms
- integer programming
- artificial intelligence
- databases
- computational complexity
- search algorithm
- data structure
- similarity measure
- website
- closely related
- decision problems
- knapsack problem
- minimum distance