Emmanuel Thomé
Abstract
We describe in this short note how it is possible to perform a Karatsuba multiplication of two polynomials of degree n - 1 using a buffer holding at most n - 1 coecffiients if n is even, and n coefficients if n is odd. This method is valid for any n (in other words, when n ≥ 2). Similar results can be obtained for the Karatsuba squaring.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We describe in this short note how it is possible to perform a Karatsuba multiplication of two polynomials of degree n - 1 using a buffer holding at most n - 1 coecffiients if n is even, and n coefficients if n is odd. This method is valid for any n (in other words, when n ≥ 2). Similar results can be obtained for the Karatsuba squaring.
Key concepts: Multiplication (music), Arithmetic, Space (punctuation), Computer science, Parallel computing, Mathematics, Combinatorics, Operating system