Computing the cube of an interval matrix is NP-Hard.
Olga KoshelevaVladik KreinovichGünter MayerHung T. NguyenPublished in: SAC (2005)
Keyphrases
- np hard
- optimal solution
- approximation algorithms
- np complete
- lower bound
- grey relation
- special case
- scheduling problem
- np hardness
- databases
- worst case
- multi dimensional
- minimum cost
- efficiently computing
- linear programming
- sufficient conditions
- closely related
- covariance matrix
- computational complexity
- linear algebra
- set cover
- coefficient matrix