![Polynomials / Computer algebra / Finite fields / Euclidean algorithm / Factorization of polynomials / Integer factorization algorithms / Greatest common divisor / Prime number / Algebraic number field / Mathematics / Abstract algebra / Algebra Polynomials / Computer algebra / Finite fields / Euclidean algorithm / Factorization of polynomials / Integer factorization algorithms / Greatest common divisor / Prime number / Algebraic number field / Mathematics / Abstract algebra / Algebra](https://www.pdfsearch.io/img/8f85eab3624474294b3f003385b99a59.jpg) Date: 2005-05-26 03:13:51Polynomials Computer algebra Finite fields Euclidean algorithm Factorization of polynomials Integer factorization algorithms Greatest common divisor Prime number Algebraic number field Mathematics Abstract algebra Algebra | | 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 ListSource URL: cocoa.dima.unige.itDownload Document from Source Website File Size: 121,18 KBShare Document on Facebook
|