Abstract
We present space and time efficient algorithms for univariate polynomial arithmetic operations over Z mod n where the modulus n does not necessarily fit into is not a machine word. These algorithms provide the key tools for the efficient implementation of polynomial resultant gcd and factorization computation over Z, without having to write large amounts of code in a systems implementation language.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Berlekamp E.R. Factoring Polynomials over Finite Fields. Bell System Technical Journal, No 46 1853–1859, 1967.
Berlekamp E.R. Factoring Polynomials over Large Finite Fields. Mathematics of Computation, 24 713–715, 1970.
Brown W.S. On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors. JACM, 18, 478–504, 1971.
Brown W.S., Traub J.F. On Euclid's Algorithm and the Theory of Subresultants. JACM, 18, 505–514, 1971.
B. Buchberger, A Theoretical Basis for the Reduction of Polynomials to Canonical Forms, ACM SIGSAM Bulletin, 9, (4), November 1976.
Cantor D.G., Zassenhaus H. A New Algorithm for Factoring Polynomials over a Finite Field. Mathematics of Computation, 36, 587–592, 1981.
Char, B.W., Geddes K.O., Gonnet, G.H. GCDHEU: Heuristic Polynomial GCD Algorithm Based On Integer GCD Computation. Proceedings of Eurosam 84. Springer-Verlag Lecture Notes in Computer Science, 174, 285–296, 1984.
Collins G.E. Subresultants and Reduced Polynomial Remainder Sequences. JACM, 14, 128–142, 1967.
Collins G.E. The Calculation of Multivariate Polynomial Resultants. JACM, 18, 515–532, 1971.
Geddes K.O., Labahn G., Czapor S.R. Algorithms for Computer Algebra. To appear 1992.
Johnson S.C., Graham R.L. Problem #7 SIGSAM Bulletin issue number 29, 8 (1), February 1974.
Kaltofen E. Computing with Polynomials Given by Straight-Line Programs: I Greatest Common Divisors. Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, 131–142, 1985.
Knuth, D.E. The Art of Computer Programming Vol. 2: Seminumerical Algorithms (Second Edition). Addison-Wesley, Reading Massachusetts, 1981.
Langemyr, L., McCallum, S. The Computation of Polynomial Greatest Common Divisors. Proceedings of EUROCAL, 1987.
Maple V Language Reference Manual Springer-Verlag, 1991.
R. Peikert, D. Wuertz, M. Monagan, C. de Groot Packing Circles in a Square: A Review and New Results. IPS Research Report No. 91-17, September 1991 ETH-Zentrum, CH-8092 Zurich, Switzerland.
Geddes K.O., Gonnet G.H., Smedley T.J. Heuristic Methods for Operations with Algebraic Numbers. Proceedings of the ACM-SIGSAM 1988 International Symposium on Symbolic and Algebraic Computation, ISSAC '88, 1988.
Smedley T.J. A New Modular Algorithm for Computation of Algebraic Number Polynomial Gcds. Proceedings of the ACM-SIGSAM 1988 International Symposium on Symbolic and Algebraic Computation, ISSAC '89, 91–94, 1989.
David Yun, The Hensel Lemma in Algebraic Manipulation. Ph.D. Thesis, Massachusetts Institute of Technology.
Paul Zimmerman, A comparison of Maple V, Mathematica 1.2 and Macsyma 3.09 on a Sun 3/60. mathPAD newsletter 1 (2), April 1991. Gruppe math PAD, Universität Paderborn.
Zippel R. Probabilistic Algorithms for Sparse Polynomials. Proceedings of Eurosam 79. Springer-Verlag Lecture Notes in Computer Science, No 72, 216–226, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monagan, M. (1993). In-place arithmetic for polynomials over Zn . In: Fitch, J. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1992. Lecture Notes in Computer Science, vol 721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57272-4_21
Download citation
DOI: https://doi.org/10.1007/3-540-57272-4_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57272-5
Online ISBN: 978-3-540-48031-0
eBook Packages: Springer Book Archive