Computing exact bounds on elements of an inverse interval matrix is NP-hard
From MaRDI portal
Publication:1809080
DOI10.1023/A:1009901405160zbMath0936.65021MaRDI QIDQ1809080
Publication date: 3 May 2000
Published in: Reliable Computing (Search for Journal in Brave)
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)
Idempotent and tropical mathematics; complexity of algorithms and interval analysis ⋮ Principal minors. I: A method for computing all the principal minors of a matrix ⋮ Interval Linear Algebra and Computational Complexity
This page was built for publication: Computing exact bounds on elements of an inverse interval matrix is NP-hard
