Greatest common divisor of two polynomials - Document - PDFSEARCH.IO

First Page	Meta Content
	Modular Methods in CoCoA What are modular methods? When you have to do a quick calculation on the back of an envelope, you might calculate the sum or product of two (small) polynomials, and you would most likely use a di Add to Reading List Document Date: 2005-05-26 03:13:51 Open Document File Size: 121,18 KB Share Result on Facebook City Davenport / / Company LC(f ) LC / / IndustryTerm p-adic solution / sequential algorithm / factorization algorithms / appropriate reconstruction algorithm / univariate reconstruction algorithm / parallel processing / trace algorithm / linear systems / πi distinct power products / power product / distinct power products / extended euclidean algorithm / / Organization g8 / / Position residue class representative / / Product Euclid / / Technology known factorization algorithms / WGD algorithm / sequential algorithm / algorithm The algorithm / univariate reconstruction algorithm / same algorithm / appropriate reconstruction algorithm / parallel processing / extended euclidean algorithm / Gr¨obner trace algorithm / / SocialTag Polynomials Computer algebra Finite fields Euclidean algorithm Factorization of polynomials Integer factorization algorithms Greatest common divisor Prime number Algebraic number field Mathematics

Modular Methods in CoCoA What are modular methods? When you have to do a quick calculation on the back of an envelope, you might calculate the sum or product of two (small) polynomials, and you would most likely use a diAdd to Reading List