Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard
From MaRDI portal
(Redirected from Publication:676167)
Recommendations
Cites work
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 804135 (Why is no real title available?)
- scientific article; zbMATH DE number 869739 (Why is no real title available?)
- Approximate linear algebra is intractable
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Interval Methods for Systems of Equations
- Interval linear systems with symmetric matrices, skew-symmetric matrices and dependencies in the right hand side
- On the Symmetric and Unsymmetric Solution Set of Interval Systems
Cited in
(5)- Solving linear interval systems is NP-hard even if we exclude overflow and underflow
- Enclosing solutions of linear interval equations is NP-hard
- Interval mathematics, algebraic equations and optimization
- scientific article; zbMATH DE number 733109 (Why is no real title available?)
- Calculation of exact bounds for the solution set of linear interval systems
This page was built for publication: Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676167)