Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard

DOI10.1007/BF02389894zbMath0871.65022MaRDI QIDQ676167

Vladik Ya. Kreinovich, Anatoly V. Lakeyev

Publication date: 1 October 1997

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

zbMATH Keywords

algorithminterval arithmeticNP-hardlinear interval equationsinclusion of solution

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Interval mathematics, algebraic equations and optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval linear systems with symmetric matrices, skew-symmetric matrices and dependencies in the right hand side
• Approximate linear algebra is intractable
• Interval Methods for Systems of Equations
• Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
• On the Symmetric and Unsymmetric Solution Set of Interval Systems

This page was built for publication: Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard