NP-hard classes of linear algebraic systems with uncertainties
From MaRDI portal
Publication:1362824
DOI10.1023/A:1009938325229zbMATH Open0884.65032MaRDI QIDQ1362824FDOQ1362824
Authors: A. V. Lakeyev, Vladik Kreinovich 
Publication date: 18 September 1997
Published in: Reliable Computing (Search for Journal in Brave)
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
complexityparameter dependenceinterval matriceslinear algebraic systemsinterval systemsNP-hard classes
Cited In (11)
- Approximate linear algebra is intractable
- Nonlinear Algebra and Optimization on Rings are “Hard”
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval systems of max-separable linear equations
- Title not available (Why is that?)
- Checking bounds on solutions of linear interval equations is NP-hard
- Sufficient conditions for the significance of the coefficients of linear models and the polynomial-time complexity of their determination from data with interval uncertainty
- Uncertain linear systems of equations: strong solvability and strong feasibility
- Why it is computationally harder to reconstruct the past than to predict the future
- Level sets and minimum volume sets of probability density functions.
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)
