Abstract
We now use the interpolation algorithms of Chapters 13 and 14 to compute the GCD of two polynomials. This is the first of the modern algorithms that we discuss. Although the principles behind the sparse polynomial GCD algorithm are quite simple, the final algorithm is more complex than any discussed thus far.
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.
Notes
The Heuristic GCD algorithm was introduced by Char, Geddes and Gonnet in 1984 [44]. Results of experimentation with GCDHeu and a partial analysis was provided in [55], and complete analysis was published in [45].
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zippel, R. (1993). Polynomial GCD’s Interpolation Algorithms. In: Effective Polynomial Computation. The Springer International Series in Engineering and Computer Science, vol 241. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3188-3_15
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3188-3_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6398-9
Online ISBN: 978-1-4615-3188-3
eBook Packages: Springer Book Archive