Parallel sparse polynomial multiplication using heaps
From MaRDI portal
Recommendations
- Parallel sparse polynomial multiplication on modern hardware architectures
- Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems
- Sparse polynomial powering using heaps
- scientific article; zbMATH DE number 1263395
- Parallel multiplication and powering of polynomials
Cited in
(18)- Comparing the speed of programs for sparse polynomial multiplication
- Polynomial modular product verification and its implications
- Sparse polynomial division using a heap
- Parallel sparse polynomial multiplication on modern hardware architectures
- Code Generation for Polynomial Multiplication
- Algorithmic Thomas decomposition of algebraic and differential systems
- Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems
- Fast interpolation and multiplication of unbalanced polynomials
- Fast n-fold Boolean convolution via additive combinatorics
- The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
- Sparse polynomial multiplication and division in Maple 14
- The basic polynomial algebra subprograms
- On the parallelization of subproduct tree techniques targeting many-core architectures
- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
- Design and implementation of multi-threaded algorithms in polynomial algebra
- 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
- Basic polynomial algebra subprograms
- Sparse polynomial powering using heaps
This page was built for publication: Parallel sparse polynomial multiplication using heaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883826)
