Extended polynomial algorithms
ACM '73 Proceedings of the ACM annual conference
How to make AXIOM into a scratchpad
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Algorithm 628: An algorithm for constructing canonical bases of polynomial ideals
ACM Transactions on Mathematical Software (TOMS)
Symbolic computation in Java: an appraisement
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Canonical representatives for residue classes of a polynomial ideal
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
A language for computational algebra
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
A language for computational algebra
ACM SIGPLAN Notices
A theoretical basis for the reduction of polynomials to canonical forms
ACM SIGSAM Bulletin
On the design of a mode-based symbolic system
ACM SIGSAM Bulletin
A FORMAT statement in SCRATCHPAD
ACM SIGSAM Bulletin
ACM SIGSAM Bulletin
| Hi-index | 0.00 |
We consider in this paper the task of synthesizing an algebraic system. Today the task is significantly simpler than in the pioneer days of symbol manipulation, mainly because of the work done by the pioneers in our area, but also because of the progress in other areas of Computer Science. There is now a considerable collection of algebraic algorithms at hand and a much better understanding of data structures and programming constructs than only a few years ago.