Optimizing the half-gcd algorithm
Computational Complexity
2022-12-26 v1
Abstract
In this paper, we propose a carefully optimized "half-gcd" algorithm for polynomials. We achieve a constant speed-up with respect to previous work for the asymptotic time complexity. We also discuss special optimizations that are possible when polynomial multiplication is done using radix two FFTs.
Cite
@article{arxiv.2212.12389,
title = {Optimizing the half-gcd algorithm},
author = {Joris van der Hoeven},
journal= {arXiv preprint arXiv:2212.12389},
year = {2022}
}