A note on multiple precision arithmetic
Communications of the ACM
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Communications of the ACM
Computer Algebra: Past and Future
Journal of Symbolic Computation
The beginning and development of FORMAC (FORmula MAnipulation Compiler)
HOPL-II The second ACM SIGPLAN conference on History of programming languages
A first report on the A# compiler
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Subresultants and Reduced Polynomial Remainder Sequences
Journal of the ACM (JACM)
The Calculation of Multivariate Polynomial Resultants
Journal of the ACM (JACM)
A Fortran Multiple-Precision Arithmetic Package
ACM Transactions on Mathematical Software (TOMS)
Communications of the ACM
Algebraic simplification: a guide for the perplexed
Communications of the ACM
Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm
Communications of the ACM
Survey of formula manipulation
Communications of the ACM
Solutions of systems of polynomial equations by elimination
Communications of the ACM
Extended polynomial algorithms
ACM '73 Proceedings of the ACM annual conference
ACM '69 Proceedings of the 1969 24th national conference
Linear circuit analysis by symbolic algebra
ACM '69 Proceedings of the 1969 24th national conference
REDUCE 2: A system and language for algebraic manipulation
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
The SAC-1 system: An introduction and survey
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
The calculation of multivariate polynomial resultants
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Algebraic simplification a guide for the perplexed
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
New languages from old: The extension of programming languages by embedding, with a case study
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Embedding extended arithmetic in SNOBOL4
ACM SIGPLAN Notices
The beginning and development of FORMAC: FORmula MAnipulation Compiler
History of programming languages---II
An efficient system for user extendible languages
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
| Hi-index | 48.30 |
PM is an IBM 7094 program system for formal manipulation of polynomials in any number of variables, with integral coefficients unrestricted in size. Some of the formal opeartions which can be performed by the system are sums, differences, products, quotients, derivatives, substitutions and greatest common divisors. PM is based on the REFCO III list processing system, which is described and compared with the LISP and SLIP systems. The PM subroutines for arithmetic of large integers are described as constituting an independently useful subsystem. PM is compared with the ALPAK system in several respects, including the choices of canonical forms for polynomials. A new algorithm for polynomial greatest common divisor calculation is mentioned, and examples are included to illustrate its superiority.