Chunky and equal-spaced polynomial multiplication

DOI10.1016/j.jsc.2010.08.013zbMath1217.65038OpenAlexW1655250744MaRDI QIDQ540329

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 algorithmspolynomial multiplicationsparse polynomialschunky multiplicationoptimal chunk size

Mathematics Subject Classification ID

Related Items (1)

Polynomial modular product verification and its implications

Cites Work

• Unnamed Item
• On fast multiplication of polynomials over arbitrary algebras
• The geobucket data structure for polynomials
• Early termination in sparse interpolation algorithms
• A framework for adaptive sorting
• Fast multiplication of large numbers
• Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
• Comparing the speed of programs for sparse polynomial multiplication

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