Skip to content

Author

Qiao-Long Huang

We have 2 of 29 papers

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 Oct 2026

Irreducibility Testing of Sparse Polynomials over Integers is NP-hard and Probabilistic Polynomial Time

In this paper, we prove that irreducibility testing for sparse polynomials in $\mathbb{Z}[X]$ is coNP-hard under deterministic polynomial-time many-one reductions. That is, there exists no polynomial-time irreducibility test algorithm unless $\mathrm P=\mathrm{NP}$. We also provide an upper bound for this problem by de...

Yi-Xuan Cao, Xiao-Shan Gao, Qiao-Long Huang et al. · 0 citations
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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.