AbstractWe investigate the integration of C implementation of fast arithmetic operations into Maple, focusing on triangular decomposition algorithms. We show substantial improvements over existing Maple implementations; our code also outperforms Magma on many examples. Profiling data show that data conversion can become a bottleneck for some algorithms, leaving room for further improvements
Polynomial multiplication is a key algorithm underlying computer algebra systems (CAS) and its effic...
International audienceThe Polynomial Modular Number System (PMNS) is an integer number system which ...
We report on some experiences with the general purpose Computer Algebra Systems (CAS) Axiom, Macsyma...
AbstractWe investigate the integration of C implementation of fast arithmetic operations into Maple,...
One of the core commands in the RegularChains library isTriangularize. The underlying decomposes the...
The Maple computer algebra system is described. Brief sample sessions show the user syntax and the m...
Though there is increased activity in the implementation of asymptotically fast polynomial arithmeti...
We demonstrate new routines for sparse multivariate polynomial multiplication and division over the ...
Given two multivariate polynomials A and B with integer coefficientswe present a new GCD algorithm w...
We discuss the parallelization of arithmetic operations on polynomials modulo a triangular set. We f...
Abstract. Some methods being used to speed up floating-point computation in Maple are described. Spe...
The RegularChains library in Maple offers a collection of commands for solving polynomial systems sy...
One of the core commands in the RegularChains library inside Maple is Triangularize. The underlying ...
We ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distribute...
Can post-Schönhage–Strassen multiplication algorithms be competitive in practice for large input siz...
Polynomial multiplication is a key algorithm underlying computer algebra systems (CAS) and its effic...
International audienceThe Polynomial Modular Number System (PMNS) is an integer number system which ...
We report on some experiences with the general purpose Computer Algebra Systems (CAS) Axiom, Macsyma...
AbstractWe investigate the integration of C implementation of fast arithmetic operations into Maple,...
One of the core commands in the RegularChains library isTriangularize. The underlying decomposes the...
The Maple computer algebra system is described. Brief sample sessions show the user syntax and the m...
Though there is increased activity in the implementation of asymptotically fast polynomial arithmeti...
We demonstrate new routines for sparse multivariate polynomial multiplication and division over the ...
Given two multivariate polynomials A and B with integer coefficientswe present a new GCD algorithm w...
We discuss the parallelization of arithmetic operations on polynomials modulo a triangular set. We f...
Abstract. Some methods being used to speed up floating-point computation in Maple are described. Spe...
The RegularChains library in Maple offers a collection of commands for solving polynomial systems sy...
One of the core commands in the RegularChains library inside Maple is Triangularize. The underlying ...
We ported the computer algebra system Maple V to the Intel Paragon, a massively parallel, distribute...
Can post-Schönhage–Strassen multiplication algorithms be competitive in practice for large input siz...
Polynomial multiplication is a key algorithm underlying computer algebra systems (CAS) and its effic...
International audienceThe Polynomial Modular Number System (PMNS) is an integer number system which ...
We report on some experiences with the general purpose Computer Algebra Systems (CAS) Axiom, Macsyma...