Michael Kaminski. A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields. In Volker Diekert, Bruno Durand, editors, STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings. Volume 3404 of Lecture Notes in Computer Science, pages 485-495, Springer, 2005. [doi]
Abstract is missing.