Parallel polynomial operations on SMPs: An overview

DOI10.1006/JSCO.1996.0021MaRDI QIDQ2564820zbMATH OpenOpenAlexFDO

Authors Paul S. Wang

Publication date 22 January 1997

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/20a43f3d1e7ecfe4fb06e63c6a99ddad0b8d9b6a

zbMATH Keywords

SMP-based parallel algorithmssymmetric multiprocessors

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1263395
• scientific article; zbMATH DE number 1263358
• A fast parallel sparse polynomial GCD algorithm
• A fast parallel sparse polynomial GCD algorithm

Cited in

(2)

• Parallel realization and analysis of SMV and DAC algorithm
• On Theorem Proving in Annotated Logics

This page was built for publication: Parallel polynomial operations on SMPs: An overview

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