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

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

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

Publication date: 9 September 1999

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

Full work available at URL: https://doi.org/10.1023/a:1024423917616

zbMATH Keywords

complexityinterval arithmeticNP-hardlinear interval systems

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

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

This page was built for publication: Solving linear interval systems is NP-hard even if we exclude overflow and underflow