Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Euclid’s Algorithm In this lecture, we study the algebraic complexity of the classic Euclid’s algorithm for polynomials, and the asymptotically fast half-gcd approach. This lecture is based upon [1, Chap[removed]
Add to Reading List
Document Date: 2012-01-30 02:26:18
Open Document
File Size: 191,22 KB
Share Result on Facebook
Company
Oxford University Press /
/
Currency
pence /
/
IndustryTerm
school algorithm /
extended euclidean algorithm /
/
Organization
Oxford University /
/
Product
Pentax K-x Digital Camera /
/
Technology
FFT-based algorithm /
3 Half-GCD Algorithm /
high-school algorithm /
half-gcd algorithm /
Extended Euclidean Algorithm /
/
SocialTag
Mathematics
Euclidean algorithm
Euclid’s Algorithm In this lecture, we study the algebraic complexity of the classic Euclid’s algorithm for polynomials, and the asymptotically fast half-gcd approach. This lecture is based upon [1, Chap[removed]