Solving linear interval systems is NP-hard even if we exclude overflow and underflow (Q1276134)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving linear interval systems is NP-hard even if we exclude overflow and underflow |
scientific article; zbMATH DE number 1240632
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving linear interval systems is NP-hard even if we exclude overflow and underflow |
scientific article; zbMATH DE number 1240632 |
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
0.9056659
0 references
0.8876677
0 references
0.88469017
0 references
0.88465905
0 references
0.84634084
0 references
0.8435941
0 references
0.8399306
0 references
