The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Journal of the ACM (JACM)
On the criteria to be used in decomposing systems into modules
Communications of the ACM
Algebraic simplification: a guide for the perplexed
Communications of the ACM
PM, a system for polynomial manipulation
Communications of the ACM
SCRATCHPAD/1: An interactive facility for symbolic mathematics
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
REDUCE 2: A system and language for algebraic manipulation
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Algebraic algorithm descriptions as programs
ACM SIGSAM Bulletin
Toward a formal implementation of computer algebra
ACM SIGSAM Bulletin
A mode analyzing algebraic manipulation program
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
Ten commandments for good default expression simplification
Journal of Symbolic Computation
| Hi-index | 0.00 |
It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.