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

Michael Kaminski. A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. SIAM Journal on Computing, 34(4):960-992, 2005. [doi]

Abstract

Abstract is missing.