Solving linear interval systems is NP-hard even if we exclude overflow and underflow
From MaRDI portal
Publication:1276134
DOI10.1023/A:1024423917616zbMath0920.65012MaRDI QIDQ1276134
Vladik Ya. Kreinovich, Gerhard Heindl, Anatoly V. Lakeyev
Publication date: 9 September 1999
Published in: Reliable Computing (Search for Journal in Brave)
65G30: Interval and finite arithmetic
65Y20: Complexity and performance of numerical algorithms
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Solving the linear interval tolerance problem for weight initialization of neural networks, Extension of the Hansen-Bliek method to right-quantified linear systems