Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable.
Jan MartensJan Friso GrootePublished in: CONCUR (2023)
Keyphrases
- np hard
- np complete
- computational complexity
- scheduling problem
- approximation algorithms
- tree decompositions
- optimal solution
- special case
- linear programming
- np hardness
- worst case
- lower bound
- decision problems
- closely related
- integer programming
- minimum cost
- constraint satisfaction problems
- computationally tractable
- search space
- knapsack problem
- search algorithm
- greedy heuristic
- dynamic programming
- unsatisfiable cores
- data model