Abstract
We discuss the family of "divide-and-conquer" algorithms for polynomial multiplication, that generalize Karatsuba's algorithm. We give explicit versions of transposed and short products for this family of algorithms and describe code generation techniques that result in high-performance implementations. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
APA
Ding, L., & Schost, É. (2009). Code generation for polynomial multiplication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5743 LNCS, pp. 66–78). https://doi.org/10.1007/978-3-642-04103-7_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free