Publication:4874515
From MaRDI portal
zbMath0841.65027MaRDI QIDQ4874515
Publication date: 1 July 1996
polynomial-time algorithm; NP-hard; linear interval equations; enclosure; bounded relative overestimation
Related Items
Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard, Interval mathematics, algebraic equations and optimization