A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields

DOI10.1137/S0097539704442118zbMath1119.11071MaRDI QIDQ5317184

Michael Kaminski

Publication date: 16 September 2005

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

zbMATH Keywords

finite fieldspolynomial multiplicationquadratic algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Recurrences (11B37) Polynomials in number theory (11C08) Polynomials over finite fields (11T06)

Related Items (1)

Unnamed Item

This page was built for publication: A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields