Registro:

Referencias:

• Apostol, T., (1976) Introduction to Analytic Number Theory, , Undergraduate Texts in Mathematics, Springer-Verlag, New York
• Ben-Or, M., Tiwari, P., A deterministic algorithm for sparse multivariate polynomial interpolation. Extended abstract (1988) STOC, pp. 301-309
• Bürgisser, P., Clausen, M., Shokrollahi, M., (1997) Algebraic Complexity Theory, 317. , Springer
• Blum, L., Dicker, F., Shub, M., Smale, S., (1998) Complexity and Real Computation, , Springer-Verlag, New York
• Borodin, A., Tiwari, P., On the decidability of sparse univariate polynomial interpolation (1991) Comput. Complexity, 1, pp. 67-90
• (1988) STOC, pp. 301-309
• Carmichael, R., (1959) The Theory of Numbers, , Copyright 1914 and 1915 by R. Carmichael, Dover, New York
• Chistov, A., Factoring polynomials over a finite field and solution of systems of algebraic equations (Russian. English summary.) Theory of the complexity of computations, II (1984) Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI), 137, pp. 124-188
• Chistov, A., Grigoriev, D., (1982) Polynomial Time Factoring of the Multivariate Polynomials over a Global Field, 39p. , Preprint LOMI E-5-82
• Chistov, A., Grigoriev, D., (1983) Subexponential-time Solving Systems of Algebraic Equations I, II, 119p. , Preprint LOMIE-9-83, E-10-83
• Clausen, M., Dress, A., Grabmeier, J., Karpinski, M., On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields (1991) Theoret. Comput. Sci., 84, pp. 151-164
• Cucker, F., Smale, S., Complexity estimates depending on condition and round-off error (1999) J.A.C.M., 46, pp. 113-184
• Dedieu, J.-P., Shub, M., Newton's method for overdetermined systems of equations (2000) Math. Comp., 69, pp. 1099-1115
• Dress, A., Grabmeier, J., The interpolation problem for k-sparse polynomials and character sums (1991) Adv. in Appl. Math., 12, pp. 57-75
• Esmonde, J., Murty, M.R., (1999) Problems in Algebraic Number Theory, 190. , Graduate Texts in Mathematics, Springer-Verlag, New York
• Giusti, M., Hägele, K., Heintz, J., Morais, J.E., Pardo, L.M., Lower bounds for diophantine approximations (1997) J. Pure AppL Algebra, 117-118, pp. 277-317
• Giusti, M., Heintz, J., Morais, J.E., Morgenstern, J., Pardo, L.M., Straight-line programs in geometric elimination theory (1998) J. Pure AppL Algebra, 124, pp. 101-146
• Grigoriev, D., Factoring polynomials over a finite field and solution of systems of algebraic equations (Russian. English summary.) Theory of the complexity of computations, II (1984) Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI), 137, pp. 20-79
• Grigoriev, D., Karpinski, M., Singer, M., Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields (1990) SIAM J. Comput., 19 (6), pp. 1059-1063
• Grigoriev, D., Karpinski, M., Singer, M., The interpolation problem for k-sparse sums of eigenfunctions of operators (1991) Adv. in Appl. Math., 12, pp. 76-81
• Grigoriev, D., Karpinski, M., Singer, M., Computational complexity of sparse rational function interpolation (1995) SIAM J. Comput., 23, pp. 1-11
• Heintz, J., Krick, T., Puddu, S., Sabia, J., Waissbein, A., Deformation techniques for efficient polynomial equation solving (2000) J. Complexity, 16, pp. 70-109
• Jeronimo, G., Krick, T., Sabia, J., Sombra, M., The computational complexity of the Chow form (2004) Found. Comput. Math., 4, pp. 41-117
• Kaltofen, E., Polynomial-time reductions from multivariate to bi- And univariate integral polynomial factorization (1985) SIAM J. Comput., 14 (2), pp. 469-489
• Kaltofen, E., Lakshman, Y.N., Improved sparse multivariate polynomial interpolation algorithms, ISSAC'88 (1988) Proc. 1988 Internat. Symp. Symbolic Algebraic Comput., 358, pp. 467-474. , Lecture Notes in Comput. Sci. Springer-Verlag, New York
• Kaltofen, E., Lakshman, Y.N., Wiley, J.-M., Modular rational sparse multivariate polynomial interpolation, ISSAC'90 (1990) Proc. 1990 Internat. Symp. Symbolic Algebraic Comput., pp. 135-139. , S. Watanabe and M. Nagata, eds., ACM Press, New York
• Kaltofen, E., Lee, W.-S., Early termination in sparse interpolation algorithms (2003) J. Symbolic Comput., 40
• Kaltofen, E., Lobo, A., Lee, W.-S., Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm (2000) ISSAC'00, Proc. 2000 Internat. Symp. Symbolic Algebraic Comput., pp. 192-201. , C. Travero, ed., ACM Press, New York
• Lecerf, G., Quadratic Newton iteration for systems with multiplicity (2002) Found. Comput. Math., 2, pp. 247-293
• Lee, W.-S., (2001) Early Termination Strategies in Sparse Interpolation Algorithms, , Ph.D. Dissertation, North Carolina State University
• Lenstra, A.K., Lenstra, H.W., Lovász, L., Factoring polynomials with rational coefficients (1982) Math. Ann., 261, pp. 515-534
• (2004) PARI/GP, Version 2. 2. 8, , http://pari.math.u-bordeaux.fr/, Webpage
• Serre, J.-P., (1970) Cours D'Arith' Métique, , Presses Universitaires de France
• Shub, M., Smale, S., Complexity of Bezout's theorem V: Polynomial time (1994) Theoret. Comp. Sci., 133, pp. 141-164
• Smale, S., Newton's method estimates from data at one point (1986) The Merging of Disciplines: New Directions in Pure, Applied and Computational Mathematics, , R. Erwing, K. Gross, and C. Martin, eds.. Springer-Verlag, New York
• Smale, S., Mathematical problems for the next century (1998) Math. Intelligencer, 20, pp. 7-15
• Trinks, W., On improving approximate results of buchberger's algorithm by Newton's method (1985) Lecture Notes in Computer Science, 204, pp. 608-611. , Springer-Verlag, New York
• Winkler, F., A p-adic approach to the computation of Gröbner bases (1988) J. Symbolic Comput, 6, pp. 287-304
• Zassenhaus, H., On Hensel factorization I (1969) J. Number Theory, 1, pp. 291-311
• Zippel, R., Interpolating polynomials from their values (1990) J. Symbolic Comput., 9, pp. 375-403

Citas:

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

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

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

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