Mortality for 2×2 Matrices Is NP-Hard.
Paul C. BellMika HirvensaloIgor PotapovPublished in: MFCS (2012)
Keyphrases
- np hard
- scheduling problem
- np hardness
- approximation algorithms
- special case
- computational complexity
- linear programming
- lower bound
- early detection
- worst case
- np complete
- optimal solution
- minimum cost
- integer programming
- remains np hard
- set cover
- branch and bound algorithm
- closely related
- kronecker product
- constraint satisfaction problems
- greedy algorithm
- singular value decomposition
- positive definite
- greedy heuristic
- computationally hard
- original data
- decision problems
- pairwise comparison
- early diagnosis
- matrix completion