Qiao-Long Huang

1. Output-sensitive Sparse Polynomial GCD over Finite Fields is NP-hard
   2026/06/10 by Ruichen Qiu, Yichuan Cao, Qiao-Long Huang +2 · 1 voice · 1 citation
   Computer Science · #cs.SC #cs.CC
2. Quasi-linear Time Multiplication of Sparse Polynomials with Integer Coefficients
   2026/06/10 by Qiao-Long Huang, Yichuan Cao, Ruichen Qiu +1 · 1 voice · 1 citation
   Computer Science · #cs.SC #cs.CC
3. Sparse Polynomial Divisibility Test over Finite Field is CoNP-hard
   2026/06/10 by Yichuan Cao, Ruichen Qiu, Qiao-Long Huang +2 · 1 voice · 1 citation
   Computer Science · #cs.SC #cs.CC