Cite
HARVARD Citation
Hu, J. et al. (2021). A fast parallel sparse polynomial GCD algorithm. Journal of symbolic computation. pp. 28-63. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Hu, J. et al. (2021). A fast parallel sparse polynomial GCD algorithm. Journal of symbolic computation. pp. 28-63. [Online].