Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Factorization of Polynomials

  • Chapter
Computer Algebra

Part of the book series: Computing Supplementum ((COMPUTING,volume 4))

Abstract

Algorithms for factoring polynomials in one or more variables over various coefficient domains are discussed. Special emphasis is given to finite fields, the integers, or algebraic extensions of the rationals, and to multivariate polynomials with integral coefficients. In particular, various squarefree decomposition algorithms and Hensel lifting techniques are analyzed. An attempt is made to establish a complete historic trace for today’s methods. The exponential worst case complexity nature of these algorithms receives attention.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdali, S. K., Caviness, B. F., Pridor, A.: Modular Polynomial Arithmetic in Partial Fraction Decomposition. MACSYMA 1977, 253–261.

    Google Scholar 

  2. Adleman, L. M.: On Distinguishing Prime Numbers from Composite Numbers. Proc. 21st Symp. Foundations Comp. Sci. IEEE 1980, 387–406.

    Google Scholar 

  3. Adleman, L. M., Odlyzko, A. M.: Irreducibility Testing and Factorization of Polynomials. Proc. 22nd Symp. Foundations Comp. Sci. IEEE 1981, 409–418.

    Google Scholar 

  4. Ben-Or, M.: Probabilistic Algorithms in Finite Fields. Proc. 22nd Symp. Foundations Comp. Sci. IEEE 1981, 394–398.

    Google Scholar 

  5. Berlekamp, E. R.: Factoring Polynomials over Large Finite Fields. Math. Comp. 24, 713–735 (1970).

    Article  MathSciNet  Google Scholar 

  6. Calmet, J., Loos, R.: Deterministic Versus Probabilistic Factorization of Integral Polynomials. EUROCAM 1982 (to appear).

    Google Scholar 

  7. Cantor, D. G.: Irreducible Polynomials with Integral Coefficients Have Succinct Certificates. J. of Algorithms 2, 385–392 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  8. Cantor, D. G., Zassenhaus, H.: On Algorithms for Factoring Polynomials over Finite Fields. Math. Comp. 36, 587–592 (1981).

    Article  MathSciNet  MATH  Google Scholar 

  9. Claybrook, B. G.: Factorization of Multivariate Polynomials over the Integers. ACM SIGSAM Bulletin 10, 13 (Feb. 1976).

    Article  Google Scholar 

  10. Collins, G. E.: Factoring Univariate Polynomials in Polynomial Average Time. EUROSAM 1979, 317–329.

    Google Scholar 

  11. Davenport, J. H., Trager, B. M.: Factorization over Finitely Generated Fields. SYMSAC 1981, 200–205.

    Google Scholar 

  12. Eisenstein, F. G.: Über die Irreductibilität und einige andere Eigenschaften der Gleichung, von welcher die Theilung der ganzen Lemniscate abhängt. J. f. d. reine u. angew. Math. 39, 160–179 (1850).

    Article  MATH  Google Scholar 

  13. Gallagher, P. X.: Probabilistic Galois Theory. AMS Proc. Symp. in Pure Math., Analytic Number Theory 1972, 91–102.

    Google Scholar 

  14. Gelfond, A. O.: Transcendental and Algebraic Numbers. New York: Dover 1960.

    MATH  Google Scholar 

  15. Heintz, J., Sieveking, M.: Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables. Springer Lecture Notes Comp. Sci., Vol. 115, pp. 16–28. BerlinHeidelberg-New York: Springer 1981.

    Google Scholar 

  16. Horowitz, E.: Algorithms for Partial Fraction Decomposition and Rational Function Integration. SYMSAM 1971, 441–457.

    Google Scholar 

  17. Johnson, S. C.: Tricks for Improving Kronecker’s Method. Bell Laboratories Report 1966.

    Google Scholar 

  18. Kaltofen, E.: A Polynomial Reduction from Multivariate to Bivariate Integer Polynomial Factorization. ACM Proc. Symp. on Theory Comp. 1982, 261–266.

    Google Scholar 

  19. Kaltofen, E.: On the Complexity of Factoring Polynomials with Integer Coefficients. Ph.D. Thesis, RPI (1982), in preparation.

    Google Scholar 

  20. Kaltofen, E., Musser, D. R., Saunders, B. D.: A Generalized Class of Polynomials that Are Hard to Factor. SYMSAC 1981.

    Google Scholar 

  21. Knuth, D. E.: The Art of Computer Programming, Vol. 2. Seminumerical Algorithms. Reading, Mass.: Addison-Wesley 1969.

    MATH  Google Scholar 

  22. Knuth, D. E.: The Art of Computer Programming, Vol. 2. Seminumerical Algorithms. 2nd ed. Reading, Mass.: Addison-Wesley 1981.

    MATH  Google Scholar 

  23. Kronecker, L.: Grundzüge einer arithmetischen Theorie der algebraischen Größen. J. f. d. reine u. angew. Math. 92, 1–122 (1882).

    MATH  Google Scholar 

  24. Kung, H. T., Tong, D. M.: Fast Algorithms for Partial Fraction Decomposition SIAM J. Comp. 6, 582–593 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  25. Lang, S.: Diophantine Geometry. New York: Interscience 1962.

    MATH  Google Scholar 

  26. Lazard, D.: On Polynomial Factorization. EUROCAM 1982, to appear.

    Google Scholar 

  27. Lenstra, A. K.: Lattices and Factorization of Polynomials. ACM SIGSAM Bulletin 15, 15–16 (August 1981).

    Article  MATH  Google Scholar 

  28. Lenstra, A. K.: Lattices and Factorization of Polynomials. EUROCAM 1982, to appear.

    Google Scholar 

  29. Moenck, R. T.: On the Efficiency of Algorithms for Polynomial Factoring. Math. Comp. 31, 235–250 (1977).

    Article  MathSciNet  MATH  Google Scholar 

  30. Moore, P. M. A., Norman, A. C.: Implementing a Polynomial Factorization Problem. SYMSAC 1981, 109–116.

    Google Scholar 

  31. Moses, J., Yun, D. Y. Y.: The EZGCD Algorithm. Proc. 1973 ACM National Conf., 159–166.

    Google Scholar 

  32. Musser, D. R.: Algorithms for Polynomial Factorization. Ph.D. Thesis and TR # 134, Univ. of Wisconsin 1971.

    Google Scholar 

  33. Musser, D. R.: Multivariate Polynomial Factorization. J. ACM 22, 291–308 (1976).

    Article  MathSciNet  Google Scholar 

  34. Musser, D. R.: On the Efficiency of a Polynomial Irreducibility Test. J. ACM 25, 271–282 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  35. Narkiewicz, W.: Elementary and Analytic Theory of Algebraic Numbers. Warsaw: Polish Science Publ. 1974.

    MATH  Google Scholar 

  36. Noether, E.: Ein algebraisches Kriterium für absolute Irreduzibilität. Math. Ann. 85, 26–33 (1922).

    Article  MathSciNet  MATH  Google Scholar 

  37. Ostrowski, A. M.: On Multiplication and Factorization of Polynomials I. Aequationes Math. 13, 201–228 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  38. Plaisted, D. A.: Some Polynomial and Integer Divisibility Problems are NP-Hard SIAM J. Comp. 7, 458–464 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  39. Plaisted, D. A.: The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability SIAM J. Comp. 9, 698–705 (1980).

    Article  MathSciNet  MATH  Google Scholar 

  40. Pratt, V. R.: Every Prime Has a Succinct Certificate. SIAM J. Comp. 4, 214–220 (1975).

    MathSciNet  MATH  Google Scholar 

  41. Rabin, M. O.: Probabilistic Algorithms in Finite Fields. SIAM J. Comp. 9, 273 280 (1980).

    MathSciNet  Google Scholar 

  42. Trager, B. M.: Algebraic Factoring and Rational Function Integration. SYMSAC 1976, 219–226.

    Google Scholar 

  43. Trotter, H. F.: Algebraic Numbers and Polynomial Factorization. AMS Short Course Series, Ann Arbor 1980.

    Google Scholar 

  44. van der Waerden, B. L.: Modern Algebra, Vol. 1. Engl. transl. by F. Blum. New York: Frederick Ungar Publ. Co. 1953.

    Google Scholar 

  45. Vaughan, R. C.: Bounds for the Coefficients of Cyclotomic Polynomials. Michigan Math. J. 21, 289–295 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  46. Viry, G.: Factorisation des Polynômes à Plusieurs Variables à Coefficient Entiers. RAIRO Informatique Théorique 12, 305–318 (1978).

    MathSciNet  MATH  Google Scholar 

  47. Viry, G.: Factorisation des Polynômes à Plusieurs Variables. RAIRO Informatique Théorique 14, 209–223 (1980).

    MathSciNet  MATH  Google Scholar 

  48. Wang, P. S.: Factoring Multivariate Polynomials over Algebraic Number Fields. Math. Comp. 30, 324–336 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  49. Wang, P. S.: Preserving Sparseness in Multivariate Polynomial Factorization. MACSYMA 1977, 55–61.

    Google Scholar 

  50. Wang, P. S.: An Improved Multivariate Polynomial Factoring Algorithm. Math. Comp. 32, 1215 –1231 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  51. Wang, P. S.: Parallel p-adic Constructions in the Univariate Polynomial Factoring Algorithm. MACSYMA 1979, 310–318.

    Google Scholar 

  52. Wang, P. S.: Analysis of the p-adic Construction of Multivariate Correction Coefficients in Polynomial Factorization: Iteration vs. Recursion. EUROSAM 1979, 291–300.

    Google Scholar 

  53. Wang, P. S., Rothschild, L. P.: Factoring Multivariate Polynomials over the Integers. Math. Comp. 29, 935 –950 (1975).

    Article  MathSciNet  MATH  Google Scholar 

  54. Wang, P. S., Trager, B. M.: New Algorithms for Polynomial Square-Free Decomposition over the Integers SIAM J. Comp. 8, 300–305 (1979).

    Article  MathSciNet  MATH  Google Scholar 

  55. Weinberger, P. J.: Finding the Number of Factors of a Polynomial. 1981, submitted.

    Google Scholar 

  56. Weinberger, P. J., Rothschild, L. P.: Factoring Polynomials over Algebraic Number Fields. ACM Trans Math. Software 2, 335–350 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  57. Yun, D. Y. Y.: Hensel Meets Newton–Algebraic Construction in an Analytic Setting. In: Analytic Computational Complexity (Traub, J., ed.). New York: Academic Press 1976.

    Google Scholar 

  58. Yun, D. Y. Y.: On Squarefree Decomposition Algorithms. SYMSAC 1976, 26–35.

    Google Scholar 

  59. Yun, D. Y. Y.: On the Equivalence of Polynomial GCD and Squarefree Factorization Problems. MACSYMA 1977, 65–70.

    Google Scholar 

  60. Zassenhaus, H.: On Hensel Factorization I. J. Number Theory 1, 291–311 (1969).

    Article  MathSciNet  MATH  Google Scholar 

  61. Zassenhaus, H.: A Remark on the Hensel Factorization Method. Math. Comp. 32, 287–292 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  62. Zassenhaus, H.: Polynomial Time Factoring of Integral Polynomials. ACM SIGSAM Bulletin 15, 6–7 (1981).

    Article  Google Scholar 

  63. Zippel, R. E.: Probabilistic Algorithms for Sparse Polynomials. EUROSAM 1979, 216–226.

    Google Scholar 

  64. Zippel, R. E.: Probabilistic Algorithms for Sparse Polynomials. Ph.D. Thesis, M.I.T., 1979.

    Google Scholar 

  65. Zippel, R. E.: Newton’s Iteration and the Sparse Hensel Algorithm. SYMSAC 1981, 68–72.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences, University of Delaware, Newark, DE, 19711, USA

    E. Kaltofen M. S.

Authors
  1. E. Kaltofen M. S.
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Mathematik, Johannes Kepler Universität Linz, Austria

    Bruno Buchberger

  2. Computer Science Department, University of Wisconsin-Madison, Madison, Wis., USA

    George Edwin Collins

  3. Institut für Informatik I, Universität Karlsruhe, Federal Republic of Germany

    Rüdiger Loos

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Wien

About this chapter

Cite this chapter

Kaltofen, E. (1982). Factorization of Polynomials. In: Buchberger, B., Collins, G.E., Loos, R. (eds) Computer Algebra. Computing Supplementum, vol 4. Springer, Vienna. https://doi.org/10.1007/978-3-7091-3406-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-3406-1_8

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81684-4

  • Online ISBN: 978-3-7091-3406-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation