Why it is computationally harder to reconstruct the past than to predict the future

DOI10.1007/BF02435838zbMath0885.65047OpenAlexW2045461672MaRDI QIDQ1376490

Misha Koshelev, Günter Mayer, G. E. Alefeld

Publication date: 2 April 1998

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02435838

zbMATH Keywords

linear interval equationsNP-hardnessexact bounds on solutions

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP-hard classes of linear algebraic systems with uncertainties
• Approximate linear algebra is intractable
• Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
• The Shape of the Solution Set for Systems of Interval Linear Equations with Dependent Coefficients
• On the Shape of the Symmetric, Persymmetric, and Skew-Symmetric Solution Set
• Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard

This page was built for publication: Why it is computationally harder to reconstruct the past than to predict the future