On a refined analysis of some problems in interval arithmetic using real number complexity theory

Reliable Computing

Volumn 10, Issue 3, 2004, Pages 209-225

  Meer, Klaus ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATA REDUCTION; DIGITAL ARITHMETIC; ERROR ANALYSIS; INFORMATION ANALYSIS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING; SET THEORY;

COMPLEXITY THEORY; REAL NUMBERS; REFINED ANALYSIS; TURING MODELS;

NUMBER THEORY;

EID: 3042798881     PISSN: 13853139     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:REOM.0000032109.55408.1a     Document Type: Article

References (22)

1. Blum, L., Cucker, F., Shub, M., and Smale, S.: Complexity and Real Computation, Springer, 1998.
2. Bochnak, J., Coste, M., and Roy, M. F.: Real Algebraic Geometry, Springer, 1998.
3. Cucker, F. and Matamala, M.: On Digital Nondeterminism, Mathematical Systems Theory 29 (1996), pp. 635-647.
4. Cucker, F., Shub, M., and Smale, S.: Complexity Separations in Koiran's Weak Model, Theoretical Computer Science 133 (1994), pp. 3-14.
5. Gelfand, I. M., Kapranov, M. M., and Zelevinsky, A. V.: Discriminants, Resultants, and Multidimensional Determinants, Birkhäuser, 1994.
6. Grädel, E. and Meer, K.: Descriptive Complexity Theory over the Real Numbers, in: Renegar, J., Shub, M., and Smale, S. (eds), Lectures in Applied Mathematics 32, 1996, pp. 381-403.
7. Gustafson, S. Å. and Kortanek, K. O.: Semi-Infinte Programming and Applications, in: Bachern, A., Grötschel, M., and Korte, B. (eds), Mathematical Programming: The State of the Art, Springer, 1983, pp. 132-157.
8. Hettich, R., and Jongen, H. Th.: Semi-Infinite Programming: Conditions of Optimality and Applications, in: Stoer, J. (ed.), Optimization Techniques, Part 2, Lecture Notes in Control and Inform. Sci. 7, Springer, 1978, pp. 1-11.
9. Hettich, R. and Kortanek, K. O.: Semi-Infinite Programming, SIAM Review 35 (3) (1993), pp. 380-429.
10. Jongen, H. Th., Twilt, F., and Weber, G. W.: Semi-Infinite Optimization: Structure and Stability of the Feasible Set, Journal Opt. Theory Applications 72 (1992), pp. 529-552.
11. th Annual IEEE Symposium on Foundations of Computer Science, 1993, pp. 486-495.
12. Koshelev, M., Longpré, L., and Taillibert, P.: Optimal Enclusure of Quadratic Interval Functions, Reliable Computing 4 (4) (1998), pp. 351-360.
13. Kreinovich, V., Lakeyev, A. V., Rohn, J., and Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations, Kluwer Academic Publishers, 1997.
14. Lakeyev, A. V. and Noskov, S. I.: A Description of the Set of Solutions of a Linear Equation with Interval Defined Operator and Right-Hand Side, Russain Acad. Sci. Dokl. Math. 47 (3) (1993), pp. 518-523.
15. Meer, K.: On the Complexity of Quadratic Programming in Real Number Models of Computation, Theoretical Computer Science 133 (1994), pp. 85-94.
16. Mumford, D.: Algebraic Geometry I: Complex Projective Varieties, Springer, 1976.
17. Plaisted, D. A.: New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems, Theoretical Computer Science 31 (1984), pp. 125-138.
18. Shub, M.: Some Remarks on Bezout's Theorem and Complexity Theory, in: Hirsch, M., Marsden, J., and Shub, M. (eds), Form Topology to Computation: Proc. of the Smalefest, Springer, 1993, pp. 443-455.
19. Stockmeyer, L.: The Polynomial-Time Hierarchy, Theoretical Computer Science 3 (1977), pp. 1-22.
20. Sturmfels, B.: Introduction to Resultants, in: Cox, D. A. and Sturmfels, B. (eds), Application of Computational Algebraic Geometry, Proc. of Symposia in Applied Mathematics 53, American Mathematical Society, 1998, pp. 25-39.
21. Tichatschke, R., Hettich, R., and Still, G.: Connections between Generalized, Inexact and Semi-Infinite Linear Programming, ZOR - Methods and Models of Operations Research 33 (1989), pp. 367-382.
22. Woźniakowski, H.: Why Does Information-Based Complexity Use the Real Number Model? Theoretical Computer Science 219 (1999), pp. 451-465.