Abstract
The problem of factoring polynomials arises in numerous areas in symbolic computation. Indeed, it plays a critical role as a subproblem to many other problems including simplification, symbolic integration and the solution of polynomial equations. Polynomial fac torization also plays a significant role in such diverse fields as algebraic coding theory, cryptography and number theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E.R. Berlekamp, “Factoring Polynomials over Finite Fields,” Bell System Technical Journal, 46 pp. 1853–1859 (1967).
E.R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York (1968).
E.R. Berlekamp, “Factoring Polynomials over Large Finite Fields,” Math. Comp., 24 pp. 713–735 (1970).
D.G. Cantor and H. Zassenhaus, “A New Algorithm for Factoring Polynomials over a Finite Field,” Math. Comp., 36 pp. 587–592 (1981).
I.N. Herstein, Topics in Algebra, Blaisdell (1964).
E. Kaltofen, “Factorization of Polynomials,” pp. 95–113 in Computer Algebra — Symbolic and Algebraic Computation, ed. B. Buchberger, G.E. Collins and R. Loos, Springer-Verlag (1982).
D.E. Knuth, The Art of Computer Programming, Volume 2: Seminumerical Algorithms (second edition), Addison-Wesley (1981).
S. Landau, “Factoring Polynomials over Algebraic Number Fields,” SIAM J. of Computing, 14 pp. 184–195 (1985).
D. Lazard, “On Polynomial Factorization,” pp. 126–134 in Proc. EUROCAM’ 82, Lecture Notes in Computer Science 144, Springer-Verlag (1982).
A.K. Lenstra, “Factorization of Polynomials,” pp. 169–198 in Computational Methods in Number Theory, ed. H.W. Lenstra, R. Tijdeman, (1982).
A.K. Lenstra, H.W. Lenstra, and L. Lovasz, “Factoring Polynomials with Rational Coefficients,” Math. Ann., 261 pp. 515–534 (1982).
A.K. Lenstra, “Factoring Polynomials over Algebraic Number Fields,” pp. 245–254 in Proc. EUROCAL’ 83, Lecture Notes in Computer Science 162, ed. H. van Hulzen, Springer-Verlag (1983).
R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications, Cambridge University Press (1986).
R.J. McEliece, Finite Fields for Computer Scientists and Engineers, Kluwer Academic Publishers (1987).
R.T. Moenck, “On the Efficiency of Algorithms for Polynomial Factoring,” Math. Comp., 31 pp. 235–250 (1977).
M.O. Rabin, “Probabilistic Algorithms in Finite Fields,” SIAM J. Computing, 9 pp. 273–280 (1980).
B. Trager, “Algebraic Factoring and Rational Function Integration,” pp. 219–226 in Proc. SYMSAC’ 76, ed. R.D. Jenks, ACM Press (1976).
B.L. van der Waerden, Modern Algebra (Vols. I and II), Ungar (1970).
P. Wang, “Factoring Multivariate Polynomials over Algebraic Number Fields,” Math. Comp., 30 pp. 324–336 (1976).
P.S. Wang, “An Improved Multivariate Polynomial Factoring Algorithm,” Math. Comp., 32 pp. 1215–1231 (1978).
P.S. Wang, “Parallel p-adic Construction in the Univariate Polynomial Factoring Algorithm,” Proc. of MACSYMA Users Conference, pp. 310–318 (1979).
D.Y.Y. Yun, “On Square-Free Decomposition Algorithms,” pp. 26–35 in Proc. SYMSAC’ 76, ed. R.D. Jenks, ACM Press (1976).
H. Zassenhaus, “Hensel Factorization I,” J. Number Theory, 1 pp. 291–311 (1969).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Kluwer Academic Publishers
About this chapter
Cite this chapter
Geddes, K.O., Czapor, S.R., Labahn, G. (1992). Polynomial Factorization. In: Algorithms for Computer Algebra. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-33247-5_8
Download citation
DOI: https://doi.org/10.1007/978-0-585-33247-5_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9259-0
Online ISBN: 978-0-585-33247-5
eBook Packages: Springer Book Archive