A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields.

Michael Kaminski

Browse the full STACS paper archive.