 Date: 2016-05-19 17:03:48Mathematics Multiplication Polynomials Algebra Multiplication algorithm Computer algebra ToomCook multiplication Karatsuba algorithm Degree of a polynomial Finite field Remainder Computational complexity of mathematical operations | |  Smoothness Testing of Polynomials over Finite Fields Jean-Franc ¸ ois Biasse and Michael J. Jacobson Jr. Department of Computer Science, University of Calgary 2500 University Drive NW
Add to Reading ListSource URL: www.lix.polytechnique.frDownload Document from Source Website File Size: 331,66 KBShare Document on Facebook
|