The modpn library: bringing fast polynomial arithmetic into MAPLE (original) (raw)
Related papers
Sparse polynomial multiplication and division in Maple 14
ACM Communications in Computer Algebra, 2011
Fermat benchmarks for rational expressionals in maple
ACM Communications in Computer Algebra, 2017
A Modular Algorithm for Computing the Characteristic Polynomial of an Integer Matrix in Maple
Computer Algebra System Maple: A New Software Library
Lecture Notes in Computer Science, 2003
High‐performance SIMD modular arithmetic for polynomial evaluation
Concurrency and Computation: Practice and Experience
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Lecture Notes in Computer Science, 2004
POLY: A New Polynomial Data Structure for Maple 17
Computer Mathematics, 2014
SINGULAR 2-2 – A Computer Algebra System for Polynomial Computations
H. Schönemann, Viktor Levandovskyy
The Maple Computer Algebra System
2000
Maple : A Computer Algebra System (An Introduction to Programming)
Special Talk, 2019
A sympy/sage Module for Computing Polynomial Remainder Sequences: [preprint]
2017
Integer Factorization and Computing Discrete Logarithms in Maple
2008
The Basic Polynomial Algebra Subprograms
Lecture Notes in Computer Science, 2014
On the Design and Performance of the Maple System
1984
CoCoALib: a C++ library from Algebra to Applications
WORKING WITH MULTIVARIATE POLYNOMIALS IN MAPLE
Another look at some fast modular arithmetic methods
Journal of Mathematical Cryptology, 2009
A tutorial introduction to Maple
Journal of Symbolic Computation, 1986
Polynomial Factorization in Maple 2019
2019
High precision computation of elementary functions in Maple
2002
Fast Parallel Computation of Polynomials Using Few Processors
SIAM Journal on Computing, 1983
A parallel implementation for polynomial multiplication modulo a prime
2015
Fast Modular Reduction for Large-Integer Multiplication by Suhas Sreehari
2015
Fast , Parallel Algorithm for Multiplying Polynomials with Integer Coefficients
2012
The PoSSo Library for Polynomial System Solving
1995
A fast and stable algorithm for splitting polynomials
Computers & Mathematics with Applications, 1997
18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007
Modern Computer Arithmetic (version 0.5.1)
ArXiv, 2010
Linear recurring sequences for computing the resultant of multivariate polynomials
Journal of Computational and Applied Mathematics, 1993
Springer eBooks, 1999
Computer algebra systems as mathematical optimizing compilers
Science of Computer Programming, 2006
An Open-source Library of Large Integer Polynomial Multipliers
2021 24th International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS)