Complexity of Polynomial Multiplication over Finite Fields

Michael Kaminski. Complexity of Polynomial Multiplication over Finite Fields. In Dima Grigoriev, John Harrison, Edward A. Hirsch, editors, Computer Science - Theory and Applications, First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings. Volume 3967 of Lecture Notes in Computer Science, pages 2, Springer, 2006. [doi]

Abstract

Abstract is missing.