Mathematical Foundations of Computer Science 2003

DOI10.1007/B11836MaRDI QIDQ5431346zbMATH OpenOpenAlexFDO

Authors Klaus Meer

Publication date 7 December 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On a refined analysis of some problems in interval arithmetic using real number complexity theory
• Why intervals? Because if we allow other sets, tractable problems become intractable
• Optimal enclosure of quadratic interval functions
• 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

Cited in

(9)

• Optimal enclosure of quadratic interval functions
• Why intervals? Because if we allow other sets, tractable problems become intractable
• A lower bound for range enclosure in interval arithmetic
• On a refined analysis of some problems in interval arithmetic using real number complexity theory
• Interval Stabbing Problems in Small Integer Ranges
• scientific article; zbMATH DE number 1346365 (Why is no real title available?)
• Interval additive generators of interval t-norms and interval t-conorms
• Complexity of interpolation and related problems in positive calculi
• scientific article; zbMATH DE number 852338 (Why is no real title available?)

This page was built for publication: Mathematical Foundations of Computer Science 2003

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