Sharp estimates for triangular sets

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2004, Pages 103-110

  Dahan, Xavier ^a   Schost, Éric ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

Intrinsic bounds; Polynomial systems; Triangular sets

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS;

INTRINSIC BOUNDS; POLYNOMIAL SYSTEMS; RATIONAL FIELDS; TRIANGULAR SETS;

SET THEORY;

EID: 27644512413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005285.1005302     Document Type: Conference Paper

References (24)

1. M. E. Alonso, E. Becker, M.-F. Roy, and T. Wörmann. Zeroes, multiplicities and idempotents for zerodimensional systems. In MEGA'94, volume 142 of Prog. in Math., pages 1-15. Birkhäuser, 1996.
2. P. Aubry, D. Lazard, and M. M. Maza. On the theories of triangular sets. J. Symb. Comp, 28(1,2):45-124, 1999.
3. P. Aubry and A. Valibouze. Using Galois ideals for computing relative resolvents. J. Symb. Comp, 30(6):635-651, 2000.
4. J.-B. Bost, H. Gillet, and C. Soulé, Heights of projective varieties and positive Green forms. J. Amer. Math. Soc., 7(4):903-1027, 1994.
5. X. Dahan. Bornes de hauteur pour la représentation triangulaire de variétés présentant des symétries. www.stix.polytechnique.fr/~dahan, 2003.
6. G. Gallo and B. Mishra. Efficient algorithms and bounds for Wu-Ritt characteristic sets. In MEGA '90, volume 94 of Prog. in Math., pages 119-142. Birkhäuser, 1990.
7. P. Gaudry and É. Schost. Construction of secure random curves of genus 2 over prime fields. 2003.
8. M. Giusti, K. Hägele, J. Heintz, J. E. Morais, J. L. Montaña, and L. M. Pardo. Lower bounds for Diophantine approximations. J. Pure Appl. Algebra, 117-118:277-317, 1997.
9. M. Giusti, G. Lecerf, and B. Salvy. A Gröbner free alternative for polynomial system solving. J. Complexity, 17(1):154-211, 2001.
10. K. Hägele, J.-E. Morais, L.-M. Pardo, and M. Sombra. On the intrinsic complexity of the arithmetic Nullstellensatz. J. Pure. Appl. Alg., 146:103-183, 2000.
11. J. Heintz. Definability and fast quantifier elimination in algebraically closed fields. Theoret. Comput. Sci., 24(3):239-277, 1983.
12. É. Hubert. Notes on triangular sets and triangulation decomposition algorithms I: Polynomial systems. In Symbolic and Numerical Scientific Computations, volume 2630 of LNCS. Springer, 2003.
13. T. Krick, L.-M. Pardo, and M. Sombra. Sharp estimates for the arithmetic Nullstellensatz. Duke Math. J., 109(3):521-598, 2001.
14. S. Lang. Diophantine geometry. Tracts in Pure and Applied Mathematics, No. 11. Interscience, 1962.
15. D. Lazard. Solving zero-dimensional algebraic systems. J. Symb. Comp, 13(2):117-133, 1992.
16. P. J. McCarthy. Algebraic extensions of fields. Dover Publications Inc., New York, 1991.
17. P. Philippon. Sur des hauteurs alternatives. III. J. Math. Pures Appl. (9), 74(4):345-365, 1995.
18. F. Rouillier. Solving zero-dimensional systems through the Rational Univariate Representation. Appl. Algebra Engrg. Comm. Comput., 9(5):433-461, 1999.
19. É. Schost. Sur la résolution des systèmes polynomiaux à paramètres. PhD thesis, École polytechnique, 2000.
20. É. Schost. Complexity results for triangular sets. J. Symb. Comp, 36(3-4):555-594, 2003.
21. É. Schost. Computing parametric geometric resolutions. Appl. Algebra Engrg. Comm. Comput., 13(4):349-393, 2003.
22. M. Sombra. Estimaciones para el teorema de ceros de Hilbert. PhD thesis, U. de Buenos Aires, 1998.
23. A. Szanto. Computation with polynomial systems. PhD thesis, Cornell Univ., 1999.
24. D. Wang. Elimination Methods, volume XIII of Texts and monographs in symbolic computation. Springer-Verlag, 2001.