Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
The initial design of a vector based algebra system
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Algorithms for polynomial factorization.
Algorithms for polynomial factorization.
Towards a REDUCE solution to SIGSAM problem 7
ACM SIGSAM Bulletin
Solving algebraic problems with REDUCE
Journal of Symbolic Computation
A fast implementation of polynomial factorization
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
The Bath algebraic number package
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Parallel univariate polynomial factorization on shared-memory multiprocessors
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Parallel univariate p-adic lifting on shared-memory multiprocessors
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Risa/Asir—a computer algebra system
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Factorization over finitely generated fields
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
P-adic reconstruction of rational numbers
ACM SIGSAM Bulletin
Fast reduce: the trade-off between efficiency and generality
ACM SIGSAM Bulletin
What do we want from a high-level language?
ACM SIGSAM Bulletin
A comparison of the Vaxima and Reduce factorization packages
ACM SIGSAM Bulletin
ACM SIGSAM Bulletin
Small algorithms for small systems
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
This paper describes the construction of a rational function package where the GCD and factorization routines are well integrated and consistent with each other and both use state of the art algorithms. The work represents an exercise in producing a service rather than an experimental piece of code, where portability, reliability and clear readable code are important aims in addition to the obvious desire for speed. Measurements on the initial version of our package showed that even though it was based on the best of previously published methods its performance was uneven. The causes of the more notable bottle necks and the steps we took to avoid them are explained here and illustrate how apparently very fine details of coding can sometimes have gross effects on a system's overall behaviour.