On the complexity of multivariate blockwise polynomial multiplication

DOI10.1145/2442829.2442861zbMath1308.68199OpenAlexW2056559482MaRDI QIDQ5244537

Joris van der Hoeven, Grégoire Lecerf

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2442829.2442861

zbMATH Keywords

algorithmmultivariate power seriessparse polynomial multiplicationevaluation-interpolation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (3)

On the Complexity of Multivariate Polynomial Division ⋮ Accelerated tower arithmetic ⋮ Polynomial modular product verification and its implications

This page was built for publication: On the complexity of multivariate blockwise polynomial multiplication