Solving linear interval systems is NP-hard even if we exclude overflow and underflow

DOI10.1023/A:1024423917616zbMath0920.65012MaRDI QIDQ1276134

Anatoly V. Lakeyev, Gerhard Heindl, Vladik Ya. Kreinovich

Publication date: 9 September 1999

Published in: Reliable Computing (Search for Journal in Brave)

zbMATH Keywords

complexity; interval arithmetic; NP-hard; linear interval systems

Mathematics Subject Classification ID

65G30: Interval and finite arithmetic

65Y20: Complexity and performance of numerical algorithms

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Unnamed Item, Solving the linear interval tolerance problem for weight initialization of neural networks, Extension of the Hansen-Bliek method to right-quantified linear systems