Registro:

Referencias:

• Adrovic, D., Verschelde, J., Tropical algebraic geometry in Maple: A preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients (2011) J. Symbolic Comput, 46 (7), pp. 755-772
• Adrovic, D., Verschelde, J., (2012), Computing Puiseux series for algebraic surfaces. In: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (ISSAC 2012), Grenoble, France, July 22–25, pp. 20–27; Bates, D., Hauenstein, J., Peterson, C., Sommese, A., A local dimension test for numerically approximated points on algebraic sets (2009) SIAM J. Numerical Analysis, 47, pp. 3608-3623
• Elkadi, M., Mourrain, B., (1999), A new algorithm for the geometric decomposition of a variety. In: Proceedings of ISSAC’99. New York: ACM, pp. 9–16; Giusti, M., Heintz, J., (1991), Algorithmes - disons rapides - pour la décomposition d'une variété algébrique en composantes irréductibles et équidimensionelles. In: Proc. Effective methods in algebraic geometry (Castiglioncello, 1990). Progr. Math., Vol. 94. Boston, MA: Birkhäuser Boston, pp. 169–194; Giusti, M., Lecerf, G., Salvy, B., A Gröbner free alternative for polynomial system solving (2001) J. Complexity, 17 (1), pp. 154-211
• Heintz, J., Definability and fast quantifier elimination in algebraically closed fields (1983) Theoret. Comput. Sci, 24 (3), pp. 239-277
• Heintz, J., Krick, T., Puddu, S., Sabia, J., Waissbein, A., Deformation techniques for efficient polynomial equation solving (2000) J. Complexity, 16 (1), pp. 70-109
• Herrero, M.I., Jeronimo, G., Sabia, J., Affine solution sets of sparse polynomial systems (2013) J. Symbolic Comput, 51, pp. 34-54
• Jelonek, Z., On the effective Nullstellensatz (2005) Invent. Math, 162 (1), pp. 1-17
• Jeronimo, G., Krick, T., Sabia, J., Sombra, M., The computational complexity of the Chow form (2004) Found. Comput. Math, 4 (1), pp. 41-117
• Jeronimo, G., Sabia, J., Effective equidimensional decomposition of affine varieties (2002) J. Pure Appl. Algebra, 169 (2-3), pp. 229-248
• Krick, T., Pardo, L.M., Sombra, M., Sharp estimates for the arithmetic Nullstellensatz (2001) Duke Math. J, 109 (3), pp. 521-598
• Kuo, Y.C., Li, T.Y., Determining dimension of the solution component that contains a computed zero of a polynomial system (2008) J. Math. Anal. Appl, 338, pp. 840-851
• Lecerf, G., Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (2003) J. Complexity, 19 (4), pp. 564-596
• Sombra, M., A sparse effective Nullstellensatz (1999) Adv. Appl. Math, 22, pp. 271-295
• Sommese, A.J., Verschelde, J., Wampler, C.W., Numerical irreducible decomposition using PHCpack (2003) Algebra, Geometry, and Software Systems, pp. 109-129. , Berlin: Springer
• Sommese, A.J., Wampler, C.W., (2005) The Numerical Solution of Systems of Polynomials Arising in Engineering and Science, , Hackensack, NJ: World Scientific Publishing Co. Pte. Ltd
• Walker, R.J., (1950) Algebraic Curves, 13. , Princeton Mathematical Series, Princeton, NJ: Princeton University Press

Citas:

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

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

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

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