Computing exact bounds on elements of an inverse interval matrix is NP-hard

DOI10.1023/A:1009901405160zbMATH Open0936.65021MaRDI QIDQ1809080FDOQ1809080

Gregory E. Coxson

Publication date: 3 May 2000

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

zbMATH Keywords

computational complexityinterval arithmeticNP-hardexact boundsinverse interval matrix

Mathematics Subject Classification ID

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

Cited In (3)

• Interval Linear Algebra and Computational Complexity
• Idempotent and tropical mathematics; complexity of algorithms and interval analysis
• Principal minors. I: A method for computing all the principal minors of a matrix

This page was built for publication: Computing exact bounds on elements of an inverse interval matrix is NP-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809080)