Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
From MaRDI portal
Publication:3545109
Recommendations
- Comparing the speed of programs for sparse polynomial multiplication
- Parallel sparse polynomial multiplication on modern hardware architectures
- scientific article; zbMATH DE number 3866580
- Sparse polynomial multiplication and division in Maple 14
- Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems
This page was built for publication: Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545109)