Chunky and equal-spaced polynomial multiplication
From MaRDI portal
Publication:540329
DOI10.1016/j.jsc.2010.08.013zbMath1217.65038MaRDI QIDQ540329
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
adaptive algorithmspolynomial multiplicationsparse polynomialschunky multiplicationoptimal chunk size
68W30: Symbolic computation and algebraic computation
65D15: Algorithms for approximation of functions
Related Items
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