A Fast Parallel Sparse Polynomial GCD Algorithm

DOI10.1145/2930889.2930903zbMath1361.11082OpenAlexW2504258127MaRDI QIDQ2985837

Jiaxiong Hu, Michael B. Monagan

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2930889.2930903

zbMATH Keywords

sparse polynomial interpolationZippel's algorithmBen-Or/Tiwari interpolationpolynomial GCD computation

Mathematics Subject Classification ID

Numerical interpolation (65D05) Factorization (11Y05)

Related Items (2)

Parallelization of triangular decompositions: techniques and implementation ⋮ An interpolation algorithm for computing Dixon resultants

Uses Software

• Magma
• Maple
• Cilk

This page was built for publication: A Fast Parallel Sparse Polynomial GCD Algorithm