Basic polynomial algebra subprograms
From MaRDI portal
Recommendations
Cites work
- BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
- Cache complexity and multicore implementation for univariate real root isolation
- Cache-oblivious algorithms
- Fast multiplication of large numbers
- Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems
- scientific article; zbMATH DE number 107769 (Why is no real title available?)
- scientific article; zbMATH DE number 1253962 (Why is no real title available?)
- Optimizations of the subresultant algorithm
- Parallel sparse polynomial multiplication using heaps
- Symbolic integration. I: Transcendental functions
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- The Magma algebra system. I: The user language
Cited in
(9)- Sparse polynomial arithmetic with the BPAS library
- BPAS
- Subresultant chains using Bézout matrices
- The basic polynomial algebra subprograms
- scientific article; zbMATH DE number 3876581 (Why is no real title available?)
- Practical Computational Fluid Dynamics with the Finite Volume Method
- Employing C++ templates in the design of a computer algebra library
- The basic polynomial algebra subprograms
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
This page was built for publication: Basic polynomial algebra subprograms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178932)