Implementing a polynomial factorization and GCD package
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
A generalized class of polynomials that are hard to factor
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
A fast implementation of polynomial factorization
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
During 1979 the programmed version of the multivariate factorization algorithm described in [6] stabilized and replaced the old factoring algorithm in Macsyma as the standard factorizer. It has thus graduated from being a program written as part of a research project into being a tool that anyone with a copy of Macsyma may rely on. In 1981, a factoring package [4] was being prepared for distribution as a module in a forthcoming release of Reduce. During September 1982 the two authors were able to make some direct comparisons between their codes by running both factorizers on the same set of examples on the same computer at the same time. This note reports on the comparative timings so obtained.