Finding Well-Conditioned Similarities to Block-Diagonalize Nonsymmetric Matrices Is NP-Hard.
Ming GuPublished in: J. Complex. (1995)
Keyphrases
- np hard
- coefficient matrix
- finding the optimal solution
- optimal solution
- special case
- scheduling problem
- closely related
- np complete
- similarity measure
- lower bound
- worst case
- constraint satisfaction problems
- singular value decomposition
- original data
- knapsack problem
- approximation algorithms
- np hardness
- computationally hard
- search algorithm