Code generation for polynomial multiplication.
Paul Vrbik, University of Western Ontario.Wednesday September 9th, in K9509 at 3:30pm.
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.