Pages that link to "Item:Q1371175"
From MaRDI portal
The following pages link to Complexity of some linear problems with interval data (Q1371175):
Displaying 23 items.
- Open problems in computational linear algebra (Q999481) (← links)
- Several NP-hard problems arising in robust stability analysis (Q1312298) (← links)
- Computational complexity and feasibility of data processing and interval computations (Q1377914) (← links)
- On the optimal solution set in interval linear programming (Q1734777) (← links)
- Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard (Q1806034) (← links)
- On a refined analysis of some problems in interval arithmetic using real number complexity theory (Q1826441) (← links)
- Checking bounds on solutions of linear interval equations is NP-hard (Q1894514) (← links)
- Approximate linear algebra is intractable (Q1906787) (← links)
- On the computational complexity of the solution of linear systems with moduli (Q1916984) (← links)
- Duality gap in interval linear programming (Q2302757) (← links)
- Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases (Q2311118) (← links)
- Checking weak optimality and strong boundedness in interval linear programming (Q2317620) (← links)
- Control solvability of interval systems of max-separable linear equations (Q2494660) (← links)
- Sufficient conditions for the significance of the coefficients of linear models and the polynomial-time complexity of their determination from data with interval uncertainty (Q2691535) (← links)
- Computing the norm ∥<i>A</i>∥∞,1 is NP-hard<sup>∗</sup> (Q4498326) (← links)
- Interval Linear Algebra and Computational Complexity (Q4554518) (← links)
- (Q4915357) (← links)
- (Q4915360) (← links)
- The Worst Case Finite Optimal Value in Interval Linear Programming (Q5145061) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Interval max-plus matrix equations (Q5962506) (← links)
- Complexity issues in interval linear programming (Q6619770) (← links)
- Linear programming sensitivity measured by the optimal value worst-case analysis (Q6644997) (← links)