Parallel sparse polynomial multiplication using heaps
From MaRDI portal
Publication:2883826
DOI10.1145/1576702.1576739zbMath1237.68258OpenAlexW2033042165MaRDI QIDQ2883826
Roman Pearce, Michael B. Monagan
Publication date: 13 May 2012
Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1576702.1576739
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)
Related Items (8)
Fundamental invariants for the action of $SL_3(\mathbb {C}) \times SL_3(\mathbb {C}) \times SL_3(\mathbb {C})$ on $3 \times 3 \times 3$ arrays ⋮ Algorithmic Thomas decomposition of algebraic and differential systems ⋮ Sparse polynomial division using a heap ⋮ The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects ⋮ Basic Polynomial Algebra Subprograms ⋮ Code Generation for Polynomial Multiplication ⋮ Polynomial modular product verification and its implications ⋮ The basic polynomial algebra subprograms
Uses Software
This page was built for publication: Parallel sparse polynomial multiplication using heaps
