Comparing the speed of programs for sparse polynomial multiplication
From MaRDI portal
Recommendations
- Sparse polynomial multiplication and division in Maple 14
- On the choice of a multiplication algorithm for polynomials and polynomial matrices
- Parallel sparse polynomial multiplication on modern hardware architectures
- Parallel sparse polynomial multiplication using heaps
- scientific article; zbMATH DE number 3866580
Cited in
(15)- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
- Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
- Embed in ensemble to rigorously and accurately homogenize quasi-periodic multi-scale heterogeneous material
- Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
- Overcoming the memory wall in symbolic algebra
- Sparse polynomials in FLINT
- Sparse polynomial multiplication and division in Maple 14
- Good coupling for the multiscale patch scheme on systems with microscale heterogeneity
- Nearly Optimal Sparse Polynomial Multiplication
- The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
- Evaluation of a Java Computer Algebra System
- scientific article; zbMATH DE number 3866580 (Why is no real title available?)
- Integration by parts: an introduction
- Chunky and equal-spaced polynomial multiplication
- Sparse polynomial division using a heap
This page was built for publication: Comparing the speed of programs for sparse polynomial multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4810194)
