Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Symbolic and Algebraic Manipulation

EUROSAM 1984: EUROSAM 84 pp 285–296Cite as

GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation

  • Pactorization And GCD Computations
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 174))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Donald Knuth, The Art of Computer Programming, vol. 2, 2nd ed., Addison Wesley (1981).

    Google Scholar 

  2. G.E. Collins, “Subresultants and Reduced Polynomial Remainder Sequences,” Journal of the ACM 14, pp. 128–142 (1967).

    Google Scholar 

  3. W.S. Brown, “The Subresultant PRS Algorithm,” ACM Transactions on Mathematical Software 4(3), pp. 237–249 (1978).

    Google Scholar 

  4. Anthony Hearn, “Non-modular computation of polynomial GCD's using trial division,” Proceedings of Eurosam 79, pp. 227–239, Springer-Verlag (1979). Springer-Verlag Lecture Notes in Computer Science no. 72.

    Google Scholar 

  5. W.S. Brown, “On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors,” Journal of the ACM 18(4), pp. 478–504 (1971).

    Google Scholar 

  6. Richard Zippel, “Probabilistic Algorithms for Sparse Polynomials,” Proceedings of Eurosam 79, pp. 216–226, Springer-Verlag (1979). Springer-Verlag Lecture Notes in Computer Science no. 72.

    Google Scholar 

  7. Joel Moses and David Y.Y. Yun, “The EZ GCD Algorithm,” pp. 159–166 in Proceedings of the ACM Annual Conference (August 1973).

    Google Scholar 

  8. Paul Wang, “The EEZ-GCD Algorithm,” SIGSAM Bulletin 14(2), pp. 50–60 (May 1980).

    Google Scholar 

  9. D. Lazard, “Factorization des Polynomes,” in Proceedings of the 4th Journees Algorithmiques, Poitiers (1981).

    Google Scholar 

  10. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts (1974).

    Google Scholar 

  11. Joachim von zur Gathen, “Factoring Sparse Multivariate Polynomials,” pp. 172–179 in Proceedings of the 24th Annual Symposium on Foundations of Computer Science, IEEE (Nov. 1983).

    Google Scholar 

  12. M. Mignotte, “Some Useful Bounds,” pp. 259–263 in Computer Algebra: Symbolic and Algebraic Computation, ed. B. Buchberger, G.E. Collins, and R. Loos, Springer-Verlag (1982).

    Google Scholar 

  13. Keith O. Geddes, Gaston H. Gonnet, and Bruce W. Char, Maple User's Manual, 3rd edition, University of Waterloo Computer Science Department Research Report CS-83-41, December, 1983.

    Google Scholar 

  14. John Foderaro, The FRANZ LISP Manual, Computer Science Division, U. of Calif., Berkeley (1980). For FRANZ LISP version Opus 34b.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Bruce W. Char, Keith O. Geddes & Gaston H. Gonnet

Authors
  1. Bruce W. Char
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keith O. Geddes
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gaston H. Gonnet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Fitch

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Char, B.W., Geddes, K.O., Gonnet, G.H. (1984). GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation. In: Fitch, J. (eds) EUROSAM 84. EUROSAM 1984. Lecture Notes in Computer Science, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032851

Download citation

  • DOI: https://doi.org/10.1007/BFb0032851

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13350-6

  • Online ISBN: 978-3-540-38893-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation