Abstract
We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem and obtain faster algorithms for polynomial multiplication over certain fields which do not support DFTs of large smooth orders. We prove that the famous Schönhage-Strassen’s upper bound cannot be improved over the field of rational numbers if we consider only algorithms based on consecutive applications of DFT, as all known fastest algorithms are.
This work is inspired by the recent improvement for the closely related problem of complexity of integer multiplication by Fürer and its consequent modular arithmetic treatment due to De, Kurur et al. We explore the barriers in transferring the techniques for solutions of one problem to a solution of the other.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bach, E., Shallit, J.: Algorithmic Number Theory, Cambridge, MA, vol. 1 (1996)
Bläser, M.: Private communication (2010)
Bürgisser, P., Clausen, M., Shokrollahi, A.: Algebraic Complexity Theory. Springer, Berlin (1997)
Bürgisser, P., Lotz, M.: Lower bounds on the bounded coefficient complexity of bilinear maps. J. ACM 51(3), 464–482 (2004)
Cantor, D.G., Kaltofen, E.: On fast multiplication of polynomials over arbitrary algebras. Acta Informatica 28, 693–701 (1991)
Chudnovsky, D., Chudnovsky, G.: Algebraic complexities and algebraic curves over finite fields. Journal of Complexity 4, 285–316 (1988)
Clausen, M., Baum, U.: Fast Fourier Transforms. Wissenschaftsverlag Mannheim-Leipzig-Wien-Zürich (1993)
Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 297–301 (1965)
De, A., Kurur, P.P., Saha, C., Saptharishi, R.: Fast integer multiplication using modular arithmetic. In: Proceedings of the 40th ACM STOC 2008 Conference, pp. 499–506 (2008)
Fürer, M.: Faster Integer Multiplication. In: Proceedings of the 39th ACM STOC 2007 Conference, pp. 57–66 (2007)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, New York (2003)
Kaminski, M.: An algorithm for polynomial multiplication that does not depend on the ring of constants. J. Algorithms 9, 137–147 (1988)
Pan, V.Y.: Simple Multivariate Polynomial Multiplication. J. Symbolic Computation 18, 183–186 (1994)
Rader, C.M.: Discrete Fourier transforms when the number of data samples is prime. Proc. IEEE 56, 1107–1108 (1968)
Schönhage, A.: Schnelle Multiplikation von Polynomen über Körpern der Charakteristic 2. Acta Informatica 7, 395–398 (1977)
Schönhage, A., Strassen, V.: Schnelle Multiplikation großer Zahlen. Computing 7, 281–292 (1971)
Shparlinski, I.E., Tsfasman, M.A., Vladut, S.G.: Curves with many points and multiplication in finite fields. In: Lecture Notes in Math., vol. 1518, pp. 145–169. Springer, Berlin (1992)
Strassen, V.: Vermeidung von Divisionen. Crelles J. Reine Angew. Math. 264, 184–202 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pospelov, A. (2011). Faster Polynomial Multiplication via Discrete Fourier Transforms. In: Kulikov, A., Vereshchagin, N. (eds) Computer Science – Theory and Applications. CSR 2011. Lecture Notes in Computer Science, vol 6651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20712-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-20712-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20711-2
Online ISBN: 978-3-642-20712-9
eBook Packages: Computer ScienceComputer Science (R0)