The basic polynomial algebra subprograms
From MaRDI portal
Publication:5270199
DOI10.1145/3015306.3015312zbMath1365.68484OpenAlexW4206215463MaRDI QIDQ5270199
Robert H. C. Moir, Marc Moreno Maza, Changbo Chen, Ning Xie, Farnam Mansouri, Yuzhen Xie, Svyatoslav Covanov
Publication date: 22 June 2017
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3015306.3015312
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)
Uses Software
Cites Work
- Unnamed Item
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Symbolic integration. I: Transcendental functions
- The Magma algebra system. I: The user language
- Fast multiplication of large numbers
- The Basic Polynomial Algebra Subprograms
- Parallel sparse polynomial multiplication using heaps
- BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
- Cache-Oblivious Algorithms
- Highly Scalable Multiplication for Distributed Sparse Multivariate Polynomials on Many-Core Systems
- Cache complexity and multicore implementation for univariate real root isolation
This page was built for publication: The basic polynomial algebra subprograms