Preview
Unable to display preview. Download preview PDF.
References
Donald Knuth, The Art of Computer Programming, vol. 2, 2nd ed., Addison Wesley (1981).
G.E. Collins, “Subresultants and Reduced Polynomial Remainder Sequences,” Journal of the ACM 14, pp. 128–142 (1967).
W.S. Brown, “The Subresultant PRS Algorithm,” ACM Transactions on Mathematical Software 4(3), pp. 237–249 (1978).
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.
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).
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.
Joel Moses and David Y.Y. Yun, “The EZ GCD Algorithm,” pp. 159–166 in Proceedings of the ACM Annual Conference (August 1973).
Paul Wang, “The EEZ-GCD Algorithm,” SIGSAM Bulletin 14(2), pp. 50–60 (May 1980).
D. Lazard, “Factorization des Polynomes,” in Proceedings of the 4th Journees Algorithmiques, Poitiers (1981).
A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts (1974).
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).
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).
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.
John Foderaro, The FRANZ LISP Manual, Computer Science Division, U. of Calif., Berkeley (1980). For FRANZ LISP version Opus 34b.
Author information
Authors and Affiliations
Editor information
Rights 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