NP-hard classes of linear algebraic systems with uncertainties
From MaRDI portal
Publication:1362824
DOI10.1023/A:1009938325229zbMath0884.65032MaRDI QIDQ1362824
Anatoly V. Lakeyev, Vladik Ya. Kreinovich
Publication date: 18 September 1997
Published in: Reliable Computing (Search for Journal in Brave)
complexityinterval matricesinterval systemslinear algebraic systemsparameter dependenceNP-hard classes
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Why it is computationally harder to reconstruct the past than to predict the future ⋮ Level sets and minimum volume sets of probability density functions. ⋮ Interval systems of max-separable linear equations ⋮ Unnamed Item
This page was built for publication: NP-hard classes of linear algebraic systems with uncertainties
