Computing the Interleaving Distance is NP-Hard.
Håvard Bakke BjerkevikMagnus Bakke BotnanMichael KerberPublished in: Found. Comput. Math. (2020)
Keyphrases
- np hard
- scheduling problem
- special case
- np complete
- computational complexity
- lower bound
- np hardness
- optimal solution
- distance measure
- euclidean distance
- branch and bound algorithm
- linear programming
- minimum cost
- case study
- approximation algorithms
- database
- decision problems
- distance measurement
- closely related
- distance function
- constraint satisfaction problems
- expert systems
- information systems
- machine learning