scientific article; zbMATH DE number 1263395

MaRDI QIDQ4234286zbMATH OpenFDO

Authors Mohamed O. Rayes, Paul S. Wang, Kenneth Weber

Publication date 16 July 2001

zbMATH Keywords

GCD algorithm

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Parallel algorithms in computer science (68W10) Symbolic computation and algebraic computation (68W30)

Recommendations

• A fast parallel sparse polynomial GCD algorithm
• A fast parallel sparse polynomial GCD algorithm
• scientific article; zbMATH DE number 1273687
• Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation

Cited in

(12)

• Massively parallel search for linear factors in polynomials with many variables
• A fast parallel sparse polynomial GCD algorithm
• Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation
• Parallel polynomial operations on SMPs: An overview
• On the parallelization of subproduct tree techniques targeting many-core architectures
• Parallel sparse polynomial multiplication using heaps
• A fast parallel sparse polynomial GCD algorithm
• scientific article; zbMATH DE number 1263358 (Why is no real title available?)
• scientific article; zbMATH DE number 1273687 (Why is no real title available?)
• scientific article; zbMATH DE number 871951 (Why is no real title available?)
• Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems
• Parallel sparse polynomial multiplication on modern hardware architectures

This page was built for publication:

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