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.
Partially supported by the EU Network of Excellence PASCAL Pattern Analysis, Statistical Modelling and Computational Learning and by the Danish Natural Science Research Council SNF. This publication only reflects the author’s views.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Basu, S., Pollack, R., Roy, M.F.: On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM 43(6), 1002–1045 (1996)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)
Cucker, F., Matamala, M.: On digital nondeterminism. Mathematical Systems Theory 29, 635–647 (1996)
Cucker, F., Shub, M., Smale, S.: Complexity separations in Koiran’s weak model. Theoretical Computer Science 133, 3–14 (1994)
Gelfand, I.M., Kapranov, M.M., Zelevinsky, A.V.: Discriminants, resultants, and multidimensional determimants. Birkhäuser, Basel (1994)
Gustafson, S.Å., Kortanek, K.O.: Semi-infinte programming and applications. In: Bachem, A., Grötschel, M., Korte, B. (eds.) Mathematical Programming: The State of the Art, pp. 132–157. Springer, Heidelberg (1983)
Koiran, P.: A weak version of the Blum-Shub-Smale model. In: 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 486–495 (1993)
Kreinovich, V., Lakeyev, A.V., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1997)
Kreinovich, V., Meer, K.: Complexity results for the range problem in interval arithmetic (in preparation)
Koshelev, M., Longpré, L., Taillibert, P.: Optimal Enclusure of Quadratic Interval Functions. Reliable Computing 4, 351–360 (1998)
Lakeyev, A.V., Noskov, S.I.: A description of the set of solutions of a linear equation with interval defined operator and right-hand side. Russian Acad. Sci. Dokl. Math. 47(3), 518–523 (1993)
Meer, K.: On the complexity of quadratic programming in real number models of computation. Theoretical Computer Science 133, 85–94 (1994)
Meer, K.: On a refined analysis of some problems in interval arithmetic using real number complexity theory. Reliable Computing 10(3), 209–225 (2004)
Plaisted, D.A.: New NP-hard and NP-complete polynomial and integer divisibility problems. Theoretical Computer Science 31, 125–138 (1984)
Rohn, J.: Enclosing solutions of linear interval equations is NP-hard. Computing 53, 365–368 (1994)
Sturmfels, B.: Introduction to resultants. Application of Computational Algebraic Geometry. In: Cox, D.A., Sturmfels, B. (eds.) Proc. of Symposia in Applied Mathematics, vol. 53, pp. 25–39. American Mathematical Society, Providence (1998)
Woźniakowski, H.: Why does information-based complexity use the real number model? Theoretical Computer Science 219, 451–465 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meer, K. (2006). On the Approximation of Interval Functions. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2004. Lecture Notes in Computer Science, vol 3732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558958_19
Download citation
DOI: https://doi.org/10.1007/11558958_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29067-4
Online ISBN: 978-3-540-33498-9
eBook Packages: Computer ScienceComputer Science (R0)