Registro:

Referencias:

• Auzinger, W., Stetter, H.J., An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations (1988) In: Proceedings of International Conference on Numerical Mathematics, International Series of Numerical Mathematics, 86, pp. 12-30. , Birkhäuser, Basel
• Becker, E., Cardinal, J., Roy, M., Szafraniec, Z., Multivariate Bezoutians, Kronecker symbol and Eisenbud-Levine formula (1996) Algorithms in Algebraic Geometry and Applications, Progress in Mathematics, Vol. 143, pp. 79-104. , L. González-Vega, & T. Recio. Basel: Birkhäuser
• Canny, J.F., (1988) The Complexity of Robot Motion Planning, , Cambridge, MA: MIT Press
• Canny, J.F., Generalised characteristic polynomials (1992) J. Symbolic Comput., 9, pp. 241-250
• Canny, J.F., Manocha, D., The implicit representation of rational parametric surfaces (1992) J. Symbolic Comput., 13, pp. 485-510
• Cattani, E., Dickenstein, A., Sturmfels, B., Residues and resultants (1998) J. Math. Sci. Univ. Tokyo, 5, pp. 119-148
• Cayley, A., On the theory of elimination (1848) Cambridge Dublin Math. J., 3, pp. 116-120
• Chardin, M., The resultant via a Koszul complex (1993) Computational Algebraic Geometry, Progress in Mathematics, Vol. 109, pp. 29-39. , F. Eyssette, & A. Galligo. Boston: Birkhäuser
• Chardin, M., Formules à la Macaulay pour les sous-résultants en plusieurs variables (1994) C. R. Acad. Sci. Paris, Sér. I, 319, pp. 433-436
• Chardin, M., Multivariate subresultants (1995) J. Pure Appl. Algebra, 101, pp. 129-138
• Chionh, E.-W., Zhang, M., Goldman, R.N., (2000) Fast Computation of the Bezout and Dixon Resultant Matrices, , http://www.cs.rice.edu/mzhang, preprint, Available at:
• Demazure, M., Une définition constructive du résultant (1984) Notes Informelles de Calcul Formel, 2. , prepublication du Centre de Mathématiques de l' École Polytechnique
• Dixon, A.L., The eliminant of three quantics in two independent variables (1908) Proc. London Math. Soc., 6, pp. 49-69
• Emiris, I., Mourrain, B., Matrices in elimination theory (1999) J. Symbolic Comput., 28 (1-2), pp. 3-44
• Fitchas, N., Giusti, M., Smietanski, F., Sur la complexité du théorème de zéros (1995) Approximation & Optimization, 8, pp. 274-329. , Verlag Peter Lang, Frankfurt am Main
• Gelfand, I.M., Kapranov, M.M., Zelevinski, A.V., (1994) Discriminants, Resultants and Multidimensional Determinants, , Boston: Birkhäuser
• Jouanolou, J.P., Formes d'inertie et résultant: Un formulaire (1997) Adv. Math., 126, pp. 119-250
• Krick, T., Pardo, L.M., Sombra, M., Sharp estimates for the arithmetic Nullstellensatz Duke J. Math., , to appear
• Kunz, E., Kähler Differentials (1986) Advanced Lectures in Mathematics, , Friedr. Vieweg, Braunschweig
• Lazard, D., Résolution des Systèmes d' Équations algebriques (1981) Theoret. Comput. Sci., 15, pp. 77-100
• MacAulay, F., Some formulae in elimination (1902) Proc. London Math. Soc., 133, pp. 3-27
• Renegar, J., On the computational complexity of the first-order theory of the reals, parts I, II, III (1992) J. Symbolic Comput., 13 (3), pp. 255-352
• Rojas, J.M., Solving degenerate sparse polynomial systems faster (1999) J. Symbolic Comput., 28, pp. 155-186
• Saxena, T., (1997) Efficient Variable Elimination Using Resultants, , http://www.cs.albany.edu/saxena, Ph.D. Thesis, SUNY at Albany, Available at:
• Scheja, G., Storch, U., Ber Spurfunktionen bei vollstndigen Durchschnitten (1975) J. Reine Angew. Math., 278-279, pp. 174-190
• Tsikh, A.K., Multidimensional Residues and their Applications (1992) Translations of Mathematical Monographs, 103. , American Mathematical Society, Providence, RI
• Weyman, J., Zelevinsky, A., Determinantal formulas for multigraded resultants (1994) J. Algebraic Geom., 3, pp. 569-597

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------