Pages that link to "Item:Q1340883"
From MaRDI portal
The following pages link to Enclosing solutions of linear interval equations is NP-hard (Q1340883):
Displaying 14 items.
- Results concerning interval linear systems with multiple right-hand sides and the interval matrix equation \(AX=B\) (Q631899) (← links)
- Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard (Q676167) (← links)
- Optimal enclosure of quadratic interval functions (Q1276128) (← links)
- Solving linear interval systems is NP-hard even if we exclude overflow and underflow (Q1276134) (← links)
- Complexity of some linear problems with interval data (Q1371175) (← links)
- Algorithms that still produce a solution (maybe not optimal) even when interrupted: Shary's idea justified (Q1383750) (← links)
- On the optimal solution set in interval linear programming (Q1734777) (← links)
- Checking bounds on solutions of linear interval equations is NP-hard (Q1894514) (← links)
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems (Q1904322) (← links)
- The interval Lyapunov matrix equation: analytical results and an efficient numerical technique for outer estimation of the united solution set (Q1930971) (← links)
- (Q4851401) (← links)
- Complexity aspects of a semi-infinite optimization problem† (Q5449018) (← links)
- Calculation of exact bounds for the solution set of linear interval systems (Q5961705) (← links)
- Uncertain static plane stress analysis with interval fields (Q6556871) (← links)
