Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325468 | Journal of Symbolic Computation | 2012 | 14 Pages |
Abstract
We study the problem of computing middle products of multiple-precision integers. In particular we adapt the Karatsuba polynomial middle product algorithm to the integer case, showing how to efficiently mitigate the failure of bilinearity of the integer middle product noted by Hanrot, Quercia and Zimmermann.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
David Harvey,