Multiplicative Complexity of Polynomial Multiplication Over Finite Fields

doi 10.1109/sfcs.1987.41
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Low Space Complexity Multiplication Over Binary Fields With Dickson Polynomial Representation

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2011English

Arithmetic Properties of Polynomial Specializations Over Finite Fields

Acta Arithmetica
Number TheoryAlgebra
2009English

On Solving Systems of Diagonal Polynomial Equations Over Finite Fields

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Polynomial Invariants of Finite Groups Over Fields of Prime Characteristics

Discrete Mathematics and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
1999English

Efficient Multiplication Over Extension Fields

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On Elementary Estimates of Arithmetic Sums for Polynomial Rings Over Finite Fields

Journal of Number Theory
Number TheoryAlgebra
2019English

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation Over Finite Fields

SIAM Journal on Computing
MathematicsComputer Science
1990English

Abelian Varieties Over Finite Fields With a Specified Characteristic Polynomial Modulo \Ell

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2004English

Polynomial Factorization Over Finite Fields by Computing Euler–Poincaré Characteristics of Drinfeld Modules

Finite Fields and Their Applications
Theoretical Computer ScienceApplied MathematicsNumber TheoryEngineeringAlgebra
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy