Computing Exact Bounds on Elements of an Inverse Interval Matrix is NP-Hard.
Gregory Emmett CoxsonPublished in: Reliab. Comput. (1999)
Keyphrases
- np hard
- lower bound
- marginal probabilities
- upper bound
- worst case
- orthogonal matrices
- upper and lower bounds
- approximation algorithms
- grey relation
- lower and upper bounds
- closely related
- scheduling problem
- special case
- jacobian matrix
- correlation matrix
- graphical models
- low rank
- matrix inversion
- greedy heuristic
- matrix representation
- singular value decomposition
- minimum cost
- integer programming
- error bounds
- learning algorithm
- kernel function
- constraint satisfaction problems
- np complete
- linear programming
- least squares
- optimal solution