Checking bounds on solutions of linear interval equations is NP-hard
From MaRDI portal
Publication:1894514
DOI10.1016/0024-3795(94)00219-4zbMath0832.65043OpenAlexW2023109981MaRDI QIDQ1894514
Publication date: 6 September 1995
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(94)00219-4
interval matricesNP-hardinterval mathematicssystems of linear interval equationschecking bounds on solutions
Related Items
Interval linear systems: the state of the art, Calculation of exact bounds for the solution set of linear interval systems, Solving interval linear systems with linear programming techniques
Cites Work
- Systems of linear interval equations
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Enclosing solutions of linear interval equations is NP-hard
- Checking robust nonsingularity is NP-hard
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item