Multiplicative complexity of polynomial multiplication over finite fields

DOI10.1145/58562.59306zbMath0677.12007OpenAlexW2037460395MaRDI QIDQ3832671

Nader H. Bshouty, Michael Kaminski

Publication date: 1989

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/58562.59306

zbMATH Keywords

complexityproduct of two polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (6)

Multiplicative complexity of direct sums of quadratic systems ⋮ On the number of distinct functional graphs of affine-linear transformations over finite fields ⋮ Multiplicative complexity of vector valued Boolean functions ⋮ A lower bound for the multiplication of polynomials modulo a polynomial ⋮ Multiplication of polynomials modulo \(x^n\) ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Multiplicative complexity of polynomial multiplication over finite fields