scientific article; zbMATH DE number 869739

zbMATH Open0841.65027MaRDI QIDQ4874515FDOQ4874515

Authors: Jiří Rohn 

Publication date: 1 July 1996

Title of this publication is not available (Why is that?)

Recommendations

• Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard
• Enclosing solutions of linear interval equations is NP-hard
• Checking bounds on solutions of linear interval equations is NP-hard
• Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard

zbMATH Keywords

NP-hardpolynomial-time algorithmenclosurelinear interval equationsbounded relative overestimation

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Interval and finite arithmetic (65G30)

Cited In (7)

• Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions
• Solving linear interval systems is NP-hard even if we exclude overflow and underflow
• On a refined analysis of some problems in interval arithmetic using real number complexity theory
• Interval mathematics, algebraic equations and optimization
• Enclosing solutions of linear interval equations is NP-hard
• Computation complexity of the range of a polynomial in several variables
• Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard

This page was built for publication:

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