Qiao-Long Huang

activity

20172026

most citedBit Complexity of Polynomial GCD on Sparse Representation

2 citations · 5 across the 11 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.SC2022★ 2 cited

Bit Complexity of Polynomial GCD on Sparse Representation

Qiao-Long Huang, Xiao-Shan Gao

An input- and output-sensitive GCD algorithm for multi-variate polynomials over finite fields is proposed by combining the modular method with the Ben-Or/Tiwari sparse interpolatio…

cs.CC2022

Skew-sparse matrix multiplication

Qiao-Long Huang, Ke Ye, Xiao-Shan Gao

Based on the observation that $Q^{(p - 1) \times (p - 1)}$ is isomorphic to a quotient skew polynomial ring, we propose a new method for $(p - 1) \times (p - 1)$ matrix multiplicat…