Chunky and equal-spaced polynomial multiplication

DOI10.1016/J.JSC.2010.08.013MaRDI QIDQ540329zbMATH OpenOpenAlexFDO

Authors Daniel S. Roche

Publication date 1 June 2011

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2010.08.013

zbMATH Keywords

adaptive algorithmschunky multiplicationoptimal chunk sizepolynomial multiplicationsparse polynomials

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 3866580
• On the choice of a multiplication algorithm for polynomials and polynomial matrices
• Parallel multiplication and powering of polynomials
• On fast multiplication of polynomials over arbitrary algebras
• scientific article; zbMATH DE number 3856407

Cites work

• A framework for adaptive sorting
• Comparing the speed of programs for sparse polynomial multiplication
• Early termination in sparse interpolation algorithms
• Fast multiplication of large numbers
• scientific article; zbMATH DE number 3322464 (Why is no real title available?)
• On fast multiplication of polynomials over arbitrary algebras
• Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
• The geobucket data structure for polynomials

Cited in

(5)

• Polynomial modular product verification and its implications
• scientific article; zbMATH DE number 3866580 (Why is no real title available?)
• On the complexity of multivariate blockwise polynomial multiplication
• On exact division and divisibility testing for sparse polynomials
• Fast interpolation and multiplication of unbalanced polynomials

This page was built for publication: Chunky and equal-spaced polynomial multiplication

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