Complexity of Polynomial Multiplication over Finite Fields

Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear algorithms. It is shown that Mq (n ) 3n - o (n ). In particular, if 2 q

• Type: Conference
• Year: 2006
• Where: CSR
• Authors: Michael Kaminski
• Keywords: Bilinear Algorithms, CSR 2006, Polynomial, Theoretical Computer Science, Tight Bound Mq