Error estimation for indirect measurements: Interval computation problem is (slightly) harder than a similar probabilistic computational problem

DOI10.1023/A:1026497709529zbMath0942.65047MaRDI QIDQ1300089

Vladik Ya. Kreinovich, O. M. Kosheleva

Publication date: 2 August 2000

Published in: Reliable Computing (Search for Journal in Brave)

zbMATH Keywords

computational complexityerror estimationpolynomial time algorithminterval arithmeticNP-hardnessindirect measurementsprobabilistic computational problems

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Interval time series analysis with an application to the sterling-dollar exchange rate

This page was built for publication: Error estimation for indirect measurements: Interval computation problem is (slightly) harder than a similar probabilistic computational problem