The following pages link to (Q4851401):
Displaying 20 items.
- Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard (Q676167) (← links)
- Solving linear interval systems is NP-hard even if we exclude overflow and underflow (Q1276134) (← links)
- Calculating uncertainty intervals in approximate equation systems (Q1294585) (← links)
- Enclosing solutions of linear interval equations is NP-hard (Q1340883) (← links)
- Complexity of some linear problems with interval data (Q1371175) (← links)
- Why it is computationally harder to reconstruct the past than to predict the future (Q1376490) (← links)
- Interval mathematics, algebraic equations and optimization (Q1593830) (← links)
- Interval solutions for interval algebraic equations (Q1826594) (← links)
- Applications of interval computations to earthquake-resistant engineering: How to compute derivatives of interval functions fast (Q1899463) (← links)
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems (Q1904322) (← links)
- Approximate linear algebra is intractable (Q1906787) (← links)
- On the algebraic solution of fuzzy linear systems based on interval theory (Q1930742) (← links)
- A new approach to obtain algebraic solution of interval linear systems (Q1933765) (← links)
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases (Q2311118) (← links)
- Estimation of algebraic solution by limiting the solution set of an interval linear system (Q2391679) (← links)
- Interval linear systems as a necessary step in fuzzy linear systems (Q2397883) (← links)
- ON THE DISTANCE-DEGREE ENERGY OF GRAPHS (Q5055026) (← links)
- (Q5154473) (← links)
- Calculation of exact bounds for the solution set of linear interval systems (Q5961705) (← links)
- Tight computationally efficient approximation of matrix norms with applications (Q6114892) (← links)
