Estimations for the separation number of a polynomial system

Journal of Symbolic Computation

Volumn 24, Issue 6, 1997, Pages 683-693

  Dedieu, Jean Pierre ^a  

^a UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031539451     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1997.0161     Document Type: Article

References (5)

1. Dedieu, J.P., Yakoubsohn, J.C. (forthcoming). Two seminumerical algorithms for solving polynomial systems. Preprint.
2. Mignotte, M. (1989). Mathématiques pour le calcul formel. PUF, Paris.
3. Shub, M., Smale, S. (1993a). Complexity of Bezout's theorem 1: Geometric aspects. J. Amer. Math. Soc. 6, 459-501.
4. Shub, M., Smale, S. (1993b). Complexity of Bézout's theorem 2: Volumes and probabilities. In F. Eyssette and A. Galligo (eds), Computational Algebraic Geometry, pp. 267-285. Birkhauser, Boston.
5. Shub, M., Smale, S. (1993c). Complexity of Bezout's Theorem 3: Condition Number and Packing. J. Complexity 9, 4-14.