Fast polynomial decomposition algorithms

  • V. S. Alagar
  • Mai Thanh
Algebraic Algorithms II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 204)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. 1.
    D. R. Barton and R. E. Zippel, A polynomial decomposition algorithm, Proc. of SYMSAC 76, pp. 356–358.Google Scholar
  2. 2.
    D. R. Barton and R. E. Zippel, A polynomial decomposition algorithm, to appear in the Journal of Symbolic Computation.Google Scholar
  3. 3.
    A. Evyatar and D. B. Scott, "On Polynomials in a polynomial Bull. London Math. Soc. 4, (1972), pp. 76–178.Google Scholar
  4. 4.
    A. K. Lenstra, H. W. Lenstra,Jr., L. Lovasz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), pp. 515–534.CrossRefGoogle Scholar
  5. 5.
    R. T. Moenck, Another polynomial homomorphism, Acta Informatica 6, (1976), pp. 153–169.CrossRefGoogle Scholar
  6. 6.
    J. F. Ritt, Prime and composite polynomials, Trans. AMS 23, (1922), pp. 51–66.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • V. S. Alagar
    • 1
  • Mai Thanh
    • 1
  1. 1.Department of Computer ScienceConcordia UniversityMontrealCanada

Personalised recommendations