On the approximation of interval functions

Authors:
Klaus Meer
Affiliations:
Department of Mathematics and Computer Science, Syddansk Universitet, Odense M, Denmark
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 6
Cited 0

Separation of complexity classes in Koiran's weak model

Selected papers of the workshop on Continuous algorithms and complexity
On the complexity of quadratic programming in real number models of computation

Selected papers of the workshop on Continuous algorithms and complexity
On the combinatorial and algebraic complexity of quantifier elimination

Journal of the ACM (JACM)
Complexity and real computation

Complexity and real computation
Why does information-based complexity use the real number model?

Theoretical Computer Science - Special issue on computability and complexity in analysis
A weak version of the Blum, Shub and Smale model

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many problems in interval arithmetic in a natural way lead to a quantifier elimination problem over the reals. By studying closer the precise form of the latter we show that in some situations it is possible to obtain a refined complexity analysis of the problem. This is done by structural considerations of the special form of the quantifiers and its implications for the analysis in a real number model of computation. Both can then be used to obtain as well new results in the Turing model. We exemplify our approach by dealing with different versions of the approximation problem for interval functions.