NP-hard classes of linear algebraic systems with uncertainties
From MaRDI portal
Publication:1362824
Recommendations
- An NP-hardness result for nonlinear systems
- Uncertain linear systems of equations: strong solvability and strong feasibility
- Polytopic uncertainty for linear systems: new and old complexity results
- Uncertain linear systems
- Existence and uniqueness of solutions of uncertain linear systems
- Hardness results for structured linear systems
- Algebraic approach to the analysis of linear static systems with interval uncertainty
- Algebraic approach to the analysis of linear static systems with interval uncertainty
- NP-Hardness of Some Linear Control Design Problems
- Modelling of uncertain systems via linear programming
Cited in
(12)- scientific article; zbMATH DE number 2032311 (Why is no real title available?)
- Why it is computationally harder to reconstruct the past than to predict the future
- Interval systems of max-separable linear equations
- Approximate linear algebra is intractable
- NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations
- Level sets and minimum volume sets of probability density functions.
- Uncertain linear systems of equations: strong solvability and strong feasibility
- Nonlinear Algebra and Optimization on Rings are “Hard”
- scientific article; zbMATH DE number 7406258 (Why is no real title available?)
- scientific article; zbMATH DE number 1560347 (Why is no real title available?)
- Sufficient conditions for the significance of the coefficients of linear models and the polynomial-time complexity of their determination from data with interval uncertainty
- Checking bounds on solutions of linear interval equations is NP-hard
This page was built for publication: NP-hard classes of linear algebraic systems with uncertainties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362824)
