<--- Back to Details
First PageDocument Content
Mathematics / Multiplication / Polynomials / Algebra / Multiplication algorithm / Computer algebra / ToomCook multiplication / Karatsuba algorithm / Degree of a polynomial / Finite field / Remainder / Computational complexity of mathematical operations
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

Similar Documents

Multivariate Power Series Multiplication ´ ´ Eric Schost, LIX, Ecole polytechnique

Multivariate Power Series Multiplication ´ ´ Eric Schost, LIX, Ecole polytechnique

DocID: 1qfkd - View Document

Implementation of the DKSS Algorithm for Multiplication of Large Numbers Christoph Lüders Universität Bonn  The International Symposium on Symbolic and Algebraic Computation,

Implementation of the DKSS Algorithm for Multiplication of Large Numbers Christoph Lüders Universität Bonn The International Symposium on Symbolic and Algebraic Computation,

DocID: 1pdWN - View Document

Optimization Techniques for Small Matrix Multiplication ´ Charles-Eric Drevet ´

Optimization Techniques for Small Matrix Multiplication ´ Charles-Eric Drevet ´

DocID: 1oAcy - View Document