Abstract
The precise average and worst-case running times of the right- and left-shift gcd algorithms for $GF(q)[x]$ are derived. A new approximate integer model for the binary greatest common divisor algorithm is obtained. The right-shift polynomial worst case differs markedly for $q = 2$ and $q > 2$. The method also yields an easy analysis of the Euclidean algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
