scientific article; zbMATH DE number 804135
From MaRDI portal
Publication:4851401
Recommendations
- Solving linear interval systems is NP-hard even if we exclude overflow and underflow
- Enclosing solutions of linear interval equations is NP-hard
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Checking bounds on solutions of linear interval equations is NP-hard
- scientific article; zbMATH DE number 802414
- scientific article; zbMATH DE number 802437
- The optimal solution set of the interval linear programming problems
- The interval task of linear programming
- The optimal solution of an interval system of linear algebraic equations
- On the optimal solution set in interval linear programming
Cited in
(23)- Solving linear interval systems is NP-hard even if we exclude overflow and underflow
- Calculating uncertainty intervals in approximate equation systems
- Enclosing solutions of linear interval equations is NP-hard
- Complexity of some linear problems with interval data
- Why it is computationally harder to reconstruct the past than to predict the future
- Interval mathematics, algebraic equations and optimization
- Interval solutions for interval algebraic equations
- Applications of interval computations to earthquake-resistant engineering: How to compute derivatives of interval functions fast
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems
- Approximate linear algebra is intractable
- On the algebraic solution of fuzzy linear systems based on interval theory
- A new approach to obtain algebraic solution of interval linear systems
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
- Estimation of algebraic solution by limiting the solution set of an interval linear system
- Interval linear systems as a necessary step in fuzzy linear systems
- scientific article; zbMATH DE number 2032311 (Why is no real title available?)
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- ON THE DISTANCE-DEGREE ENERGY OF GRAPHS
- scientific article; zbMATH DE number 7406258 (Why is no real title available?)
- Calculation of exact bounds for the solution set of linear interval systems
- Tight computationally efficient approximation of matrix norms with applications
- Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard
- Robust signal recovery under uncertain-but-bounded perturbations in observation matrix
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 Q4851401)
