Computing exact bounds on elements of an inverse interval matrix is NP-hard (Q1809080)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing exact bounds on elements of an inverse interval matrix is NP-hard |
scientific article |
Statements
Computing exact bounds on elements of an inverse interval matrix is NP-hard (English)
0 references
3 May 2000
0 references
The author establishes that the problem of finding exact bounds on the elements of an inverse interval matrix is NP-hard.
0 references
inverse interval matrix
0 references
computational complexity
0 references
interval arithmetic
0 references
exact bounds
0 references
NP-hard
0 references
