Solving linear interval systems is NP-hard even if we exclude overflow and underflow (Q1276134): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Vladik Ya. Kreinovich / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Svetoslav M. Markov / rank | |||
| Property / author | |||
| Property / author: Vladik Ya. Kreinovich / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Svetoslav M. Markov / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 03:46, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving linear interval systems is NP-hard even if we exclude overflow and underflow |
scientific article |
Statements
Solving linear interval systems is NP-hard even if we exclude overflow and underflow (English)
0 references
9 September 1999
0 references
The complexity of the solution of linear interval systems is considered with special attention to computer arithmetic.
0 references
linear interval systems
0 references
interval arithmetic
0 references
complexity
0 references
NP-hard
0 references
