On the complexity of multivariate blockwise polynomial multiplication

DOI10.1145/2442829.2442861MaRDI QIDQ5244537zbMATH OpenOpenAlexFDO

Authors 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

algorithmevaluation-interpolationmultivariate power seriessparse polynomial multiplication

Mathematics Subject Classification ID

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

Recommendations

• Simple multivariate polynomial multiplication
• Chunky and equal-spaced polynomial multiplication
• On the bit-complexity of sparse polynomial and series multiplication
• scientific article; zbMATH DE number 5026599
• Multivariate power series multiplication

Cited in

(13)

• Simple multivariate polynomial multiplication
• On the bit-complexity of sparse polynomial and series multiplication
• Polynomial modular product verification and its implications
• Accelerated tower arithmetic
• Output-sensitive algorithms for sumset and sparse polynomial multiplication
• On the complexity of multivariate polynomial division
• On the Complexity of Hybrid n -Term Karatsuba Multiplier for Trinomials
• On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits
• Computing clipped products
• Sparse multiplication of multivariate linear differential operators
• On exact division and divisibility testing for sparse polynomials
• Fast interpolation and multiplication of unbalanced polynomials
• Fast n-fold Boolean convolution via additive combinatorics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244537)