scientific article; zbMATH DE number 903768

MaRDI QIDQ4885382zbMATH OpenFDO

Authors Jiří Rohn, Vladik Kreinovich, A. V. Lakeyev

Publication date 3 September 1996

zbMATH Keywords

computational complexityinterval computationssurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Interval and finite arithmetic (65G30) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Why intervals? Because if we allow other sets, tractable problems become intractable
• Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\)
• Computation complexity of the range of a polynomial in several variables
• scientific article; zbMATH DE number 3960879
• scientific article; zbMATH DE number 3940621

Cited in

(12)

• Why intervals? Because if we allow other sets, tractable problems become intractable
• Error estimation for indirect measurements: Interval computation problem is (slightly) harder than a similar probabilistic computational problem
• Why it is computationally harder to reconstruct the past than to predict the future
• Easy and optimal queries to reduce set uncertainty
• Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\)
• If we measure a number, we get an interval. What if we measure a function or an operator?
• Fast quantum algorithms for handling probabilistic and interval uncertainty
• Computation complexity of the range of a polynomial in several variables
• scientific article; zbMATH DE number 903770 (Why is no real title available?)
• Comparing system reliabilities with ill-known probabilities
• Large-Scale Scientific Computing
• A survey of computational complexity results in systems and control

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885382)