On the Genericity of the Modular Polynomial GCD Algorithm

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

Volumn 1999-January, Issue , 1999, Pages 59-65

  Kaltofen, Erich ^a   Monagan, Michael B ^b  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

ASYMPTOTIC PERFORMANCE; EUCLIDEAN DOMAIN; FINITE FIELDS; GCD ALGORITHM; GENERIC ALGORITHM; GENERICITY; MODULAR POLYNOMIAL; MODULARS; MULTIVARIATE POLYNOMIAL;

POLYNOMIALS;

EID: 34250632964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/309831.309861     Document Type: Conference Paper

References (21)

1. BERNARDIN, L., AND MONAGAN, M. B. Efficient multivariate factorization over finite fields. In Proc. AAECC-12 (Heidelberg, Germany, 1997), vol. 1255 of Lect. Notes Comput. Sci., Springer Verlag, pp. 15-28.
2. BROWN, W. S. On Euclid's algorithm and the computation of polynomial greatest common divisors. J. ACM 18 (1971), 478-504.
3. CAVINESS, B. F., AND COLLINS, G. E. Algorithms for Gaussian integer arithmetic. In Proc. 1976 ACM Symp. Symbolic Algebraic Comp. (New York, N. Y., 1976). R. D. Jenks, Ed., ACM, pp. 36 45.
4. CAVINESS, B. F., AND ROTHSTEIN, M. A modular greatest common divisor algorithm for Gaussian polynomials. In Proc. 1975 ACM Annual Conference (New York, N. Y., 1975), ACM, pp. 270-273.
5. DÍAZ, A., AND KALTOFEN, E. On computing greatest. common divisors with polynomials given by black boxes for their evaluation. In Proc. 1995 Internat. Symp. Symbolic Algebraic Comput. ISSAC'95 (New York, N. Y., 1995), A. H. M. Levelt., Ed., ACM Press, pp. 232-239.
6. DÍAZ, A., AND KALTOFEN, E. FOXBOX a system for manipulating symbolic objects in black box representation. In ISSAC'98 Proc. 1998 Internat. Symp. Symbolic Algebraic Comput. (New York. N. Y., 1998), O. Gloor, Ed., ACM Press, pp. 30-37.
7. n): The Niho case. Manuscript, German Information Security Agency, Bonn, Germany, Apr. 1998.
8. ENCARNACIÓN, M. J. Computing GCDs of polynomials over algebraic number fields. J. Symbolic Comput. 20, 3 (1995), 299-313.
9. GAUSS, C. F. Disquisitiones Arithmeticae. G. Fleischer, Jr., Leipzig, Germany, 1801.
10. GEDDES, K. O., CZAPOR, S. R., AND LABAHN, G. Algorithms for Computer Algebra. Kluwer Academic Publ., Boston, Massachusetts, USA, 1992.
11. GOLDSTEIN, A. J., AND GRAHAM, R. L. A Hadamardtype bound on the coefficients of a determinant of polynomials. SIAM Rev. 16 (1974), 394-395.
12. GRUNTZ, D., AND MONAGAN, M. B. Introduction to Gauss. No. 9 in Maple Technical Newsletter. Birkhäuser, 1993, pp. 23-35.
13. KALTOFEN, E. Sparse Hensel lifting. In EUROCAL 85 European Conf. Comput. Algebra Proc. Vol. 2 (Heidelberg, Germany, 1985). B. F. Caviness, Ed., Lect. Notes Comput. Sci., Springer Verlag, pp. 4-17. Proofs in [14].
14. KALTOFEN, E. Sparse Hensel lifting. Tech. Rep. 85-12, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, N. Y., 1985.
15. KALTOFEN, E. Greatest common divisors of polynomials given bv straight-line programs. J. ACM 35, 1 (1988), 231 264.
16. KALTOFEN, E., AND ROLLETSCHEK, H. Computing greatest common divisors and factorizations in quadratic number fields. Math. Comput. 53, 188 (1989), 697-720.
17. KALTOFEN, E., AND TRACER, B. Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. J. Symbolic Comput. 9, 3 (1990), 301-320.
18. KNUTH, D. E. Seminumerical Algorithms, Third ed., vol. 2 of The Art of Computer Programming. Addison Wesley, Reading, Massachusetts, USA, 1997.
19. MONAGAN, M., AND MARGOT, R. Computing univariate GCDs over number fields. In Proc. Symp. Discrete Algo. (1998), Soc. Indust. Appl. Math, pp. 42 49.
20. n. In Proc. DISCO'92 (Heidelberg, Germany, 1992), vol. 721 of Lect. Notes Comput. Sci., Springer Verlag, pp. 22 34.
21. MUSSER, D. R., Algorithms for polynomial factorization. PhD thesis. Univ. Wisconsin, Madison, Wisconsin, USA, 1971. Also TR#134, September 1971.