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

First Page		Document Content
Date: 2016-05-19 17:03:48 Mathematics 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 List Source URL: www.lix.polytechnique.fr Download Document from Source Website File Size: 331,66 KB Share Document on Facebook

	An Asynchronous, Iterative Implementation of the Original Booth Multiplication Algorithm A. Efthymiou W. Suntiamorntut DocID: 1u1aw - View Document
	Fast Integer Multiplication with ¨ Schonhage-Strassen’s Algorithm Alexander Kruppa CACAO team at LORIA, Nancy DocID: 1sjaC - View Document
	Design of Parallel and High Performance Computing HS 2013 Markus P¨ uschel, Torsten Hoefler Department of Computer Science ETH Zurich DocID: 1rlc8 - View Document
	A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin DocID: 1rgSV - View Document
	Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † DocID: 1rcVB - View Document