Author

Qiao-Long Huang

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Sparse Polynomial GCD Algorithms Asymptotically Linear in All Fundamental Parameters

This paper presents the first sparse GCD algorithm over the integers that achieves linear complexity in all fundamental parameters simultaneously and is the first sparse GCD algorithm over the integers that achieves linear complexity in all these parameters simultaneously.

Qiao-Long Huang, Xiao-Shan Gao · 0 citations