Pages that link to "Item:Q1362824"
From MaRDI portal
The following pages link to NP-hard classes of linear algebraic systems with uncertainties (Q1362824):
Displaying 14 items.
- Uncertain linear systems of equations: strong solvability and strong feasibility (Q508570) (← links)
- Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard (Q676167) (← links)
- An NP-hardness result for nonlinear systems (Q1276126) (← links)
- Complexity of some linear problems with interval data (Q1371175) (← links)
- The solvability of linear systems and the satisfiability (Q1373648) (← links)
- Why it is computationally harder to reconstruct the past than to predict the future (Q1376490) (← links)
- Level sets and minimum volume sets of probability density functions. (Q1426286) (← links)
- NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations (Q1709490) (← 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)
- 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)
- (Q5154473) (← links)
- Interval systems of max-separable linear equations (Q5956251) (← links)