Complexity of Polynomial Multiplication over Finite Fields

13 years 8 months ago

Download www.cs.technion.ac.il

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

Michael Kaminski

Real-time Traffic

Bilinear Algorithms | CSR 2006 | Polynomial | Theoretical Computer Science | Tight Bound Mq |

claim paper

» Factoring Polynomials over Finite Fields using Balance Test

» Detecting Rational Points on Hypersurfaces over Finite Fields

» Decidability of Subtheories of Polynomials over a Finite Field

» Achieving efficient polynomial multiplication in fermat fields using the fast Fourier tran...

» Fast arithmetics in artinschreier towers over finite fields

» Interpolation of depth3 arithmetic circuits with two multiplication gates

» On Exponential Sums Nowton identities and Dickson Polynomials over Finite Fields

» A New Representation of Elements of Finite Fields GF2m Yielding Small Complexity Arithmeti...

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	CSR
Authors	Michael Kaminski

Comments (0)

Sciweavers

Complexity of Polynomial Multiplication over Finite Fields

Bilinear Algorithms | CSR 2006 | Polynomial | Theoretical Computer Science | Tight Bound Mq |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers