Pages that link to "Item:Q1894514"
From MaRDI portal
The following pages link to Checking bounds on solutions of linear interval equations is NP-hard (Q1894514):
Displaying 11 items.
- Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard (Q676167) (← links)
- Interval linear systems: the state of the art (Q880921) (← links)
- Checking solvability of systems of interval linear equations and inequalities via mixed integer programming (Q1042106) (← links)
- An NP-hardness result for nonlinear systems (Q1276126) (← links)
- Solving linear interval systems is NP-hard even if we exclude overflow and underflow (Q1276134) (← links)
- Enclosing solutions of linear interval equations is NP-hard (Q1340883) (← links)
- Solving interval linear systems with linear programming techniques (Q1808960) (← 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)
- (Q4851401) (← links)
- Calculation of exact bounds for the solution set of linear interval systems (Q5961705) (← links)