Parallel algorithms on greatest common divisor of polynomial system

MaRDI QIDQ2886844zbMATH OpenFDO

Authors Abdulelah Mohammed, Benxi Zhu, Zhongping Sheng

Publication date 1 June 2012

Published in Journal of Jilin University. Science Edition (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmpolynomial systemgreatest common divisorpseudo-code system

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15)

Recommendations

• scientific article; zbMATH DE number 871951
• A fast parallel sparse polynomial GCD algorithm
• A fast parallel sparse polynomial GCD algorithm
• Circuits for computing the GCD of two polynomials over an algebraic number field
• Parallel Algorithms for Algebraic Problems

Cited in

(6)

• A fast parallel sparse polynomial GCD algorithm
• scientific article; zbMATH DE number 2242535 (Why is no real title available?)
• scientific article; zbMATH DE number 4135405 (Why is no real title available?)
• scientific article; zbMATH DE number 4126699 (Why is no real title available?)
• scientific article; zbMATH DE number 871951 (Why is no real title available?)
• Algorithms for computing greatest common divisors of parametric multivariate polynomials

This page was built for publication: Parallel algorithms on greatest common divisor of polynomial system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2886844)