Complexity of Bezout’s Theorem. III. Condition Number and Packing

Journal of Complexity

Volumn 9, Issue 1, 1993, Pages 4-14

  Shub, Michael ^a   Smale, Steve ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002102930     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1006/jcom.1993.1002     Document Type: Article

References (10)

1. Blum, L., Shub, M., and Smale, S. (1989), On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21, 1-46.
2. Demmel, J. (1987), On condition numbers and the distance to the nearest ill-posed problem, Numer. Math. 51, 251-289.
3. Hille, E. (1962), “Analytic Function Theory, I and II, ” Ginn, Boston.
4. Kostlan, Eric (1987), Random polynomials and the statistical fundamental theorem of algebra, preprint, Univ. of Hawaii.
5. Lubotzky, A., Phillips, R., and Sarnak, P. (1986), Hecke operators and distributing points on the sphere I, Comm. Pure Appl. Math. VXXXIX, 149-186.
6. Shub, M., and Smale, S. (1991), Complexity of Bezout’s Theorem I: Geometric aspects, J. Amer. Math. Soc., to appear.
7. Shub, M., and Smale, S. (1992), Complexity of Bezout’s Theorem 11: Volumes and probabilities, in “Computational Algebraic Geometry, ” (F. Eyssette and A. Galligo. Eds.) Birkhauser, to appear.
8. Tsuji, M. (1959), “Potential Theory in Modern Function Theory, ” Maruzen Co., Ltd., Tokyo.
9. Wilkinson, J. (1963), “Rounding Errors in Algebraic Processes, " Prentice-Hall, Englewood Cliffs, N.J.
10. Woźniakowski, H. (1977), Numerical stability for solving non-linear equations, Numer. Math. 27, 373-390.