scientific article; zbMATH DE number 903770

MaRDI QIDQ4885384zbMATH OpenFDO

Authors Yuri I. Shokin

Publication date 3 November 1996

zbMATH Keywords

computational complexityinterval algorithmsinterval analysis

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Publication:4885382
• A class of problems that can be solved using interval algorithms
• Interval analysis a powerful trend in numerical analysis
• scientific article; zbMATH DE number 3854310
• Interval analysis or Monte-Carlo methods?

Cited in

(9)

• Computational complexity and feasibility of data processing and interval computations
• Grand challenges and scientific standards in interval analysis
• Interval Stabbing Problems in Small Integer Ranges
• A class of problems that can be solved using interval algorithms
• scientific article; zbMATH DE number 1346365 (Why is no real title available?)
• Interval Linear Algebra and Computational Complexity
• A Shift-free Characterization of NP within Interval-valued Computing
• scientific article; zbMATH DE number 1440915 (Why is no real title available?)
• Theory of an interval algebra and its application to numerical analysis

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 Q4885384)