scientific article; zbMATH DE number 903770

zbMATH Open0849.65025MaRDI QIDQ4885384FDOQ4885384

Authors: Yuri I. Shokin 

Publication date: 3 November 1996

Title of this publication is not available (Why is that?)

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?

zbMATH Keywords

computational complexityinterval analysisinterval algorithms

Mathematics Subject Classification ID

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

Cited In (8)

• A Shift-free Characterization of NP within Interval-valued Computing
• A class of problems that can be solved using interval algorithms
• Interval Linear Algebra and Computational Complexity
• Computational complexity and feasibility of data processing and interval computations
• Title not available (Why is that?)
• Grand challenges and scientific standards in interval analysis
• Interval Stabbing Problems in Small Integer Ranges
• 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)