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]

First Page		Document Content
Date: 2012-01-30 02:26:18 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] Add to Reading List Source URL: www.imsc.res.in Download Document from Source Website File Size: 191,22 KB Share Document on Facebook