Multiplication of Polynomials over Finite Fields

DOI10.1137/0219029zbMath0701.11070OpenAlexW1985380514MaRDI QIDQ3478495

Michael Kaminski, Nader H. Bshouty

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6bf1dc53d67c67cc69d0198f308d71f79e480b7a

zbMATH Keywords

Hankel matriceslinear algorithmspolynomial multiplicationquadratic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (2)

Univariate polynomial factorization over finite fields ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

This page was built for publication: Multiplication of Polynomials over Finite Fields