Chunky and equal-spaced polynomial multiplication
From MaRDI portal
Publication:540329
DOI10.1016/J.JSC.2010.08.013zbMATH Open1217.65038OpenAlexW1655250744MaRDI QIDQ540329FDOQ540329
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
Recommendations
adaptive algorithmspolynomial multiplicationsparse polynomialschunky multiplicationoptimal chunk size
Symbolic computation and algebraic computation (68W30) Algorithms for approximation of functions (65D15)
Cites Work
- On fast multiplication of polynomials over arbitrary algebras
- Fast multiplication of large numbers
- Early termination in sparse interpolation algorithms
- Title not available (Why is that?)
- The geobucket data structure for polynomials
- A framework for adaptive sorting
- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
- Comparing the speed of programs for sparse polynomial multiplication
Cited In (3)
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)