The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A Subroutine for Computations with Rational Numbers
Journal of the ACM (JACM)
Subresultants and Reduced Polynomial Remainder Sequences
Journal of the ACM (JACM)
PM, a system for polynomial manipulation
Communications of the ACM
Symbolic factoring of polynomials in several variables
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
The calculation of multivariate polynomial resultants
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Algorithms for exact polynomial root calculation
Algorithms for exact polynomial root calculation
Algorithms for polynomial factorization.
Algorithms for polynomial factorization.
A Smalltalk system for algebraic manipulation
OOPLSA '86 Conference proceedings on Object-oriented programming systems, languages and applications
Parallel tree pattern matching
Journal of Symbolic Computation
A first report on the A# compiler
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
The Calculation of Multivariate Polynomial Resultants
Journal of the ACM (JACM)
The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
Journal of the ACM (JACM)
On Computing the Exact Determinant of Matrices with Polynomial Entries
Journal of the ACM (JACM)
Multivariate Polynomial Factorization
Journal of the ACM (JACM)
Corrigendum: `` Allocating Storage for Extendible Arrays''
Journal of the ACM (JACM)
Restructuring of Arithmetic Expressions For Parallel Evaluation
Journal of the ACM (JACM)
On the Efficiency of a Polynomial Irreducibility Test
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the Generation of Binary Trees
Journal of the ACM (JACM)
Theorem Proving via General Matings
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Portable Extended Precision Arithmetic Package and Library with Fortran Precompiler
ACM Transactions on Mathematical Software (TOMS)
The Exact Solution of Linear Equations with Rational Function Coefficients
ACM Transactions on Mathematical Software (TOMS)
A Comparison of Algorithms for the Exact Solution of Linear Equations
ACM Transactions on Mathematical Software (TOMS)
Polynomial manipulation with APL
Communications of the ACM
Applications of symbol manipulation in theoretical physics
Communications of the ACM
Algebraic simplification: a guide for the perplexed
Communications of the ACM
The application of symbolic mathematics to a singular perturbation problem
ACM '72 Proceedings of the ACM annual conference - Volume 2
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
ACM SIGSAM Bulletin
Using minicomputers for algebraic computations
ACM SIGSAM Bulletin
A solution to Kahan's problem (SIGSAM problem no. 9)
ACM SIGSAM Bulletin
Algebraic algorithm descriptions as programs
ACM SIGSAM Bulletin
ACM SIGIR Forum
Hi-index | 0.05 |
SAC-1 is a program system for performing operations on multivariate polynomials and rational functions with infinite-precision coefficients. It is programmed, with the exception of a few simple primitives, in ASA Fortran. As a result the system is extremely accessible, portable, easy to learn, and indeed has been implemented at more than 20 institutions. The SAC-1 system's range of programmed capabilities is exceptionally broad, including, besides the usual operations, polynomial greatest common divisor and resultant calculation, polynomial factorization, exact polynomial real zero calculation, partial fraction decomposition, rational function integration, and solution of systems of linear equations with polynomial coefficients. SAC-1 is also outstanding in its computing time efficiency, which is achieved partially through the use of appropriate data structures, but primarily through the use of mathematically sophisticated and analyzed algorithms, which are briefly surveyed. The efficiency gains, frequently orders of magnitude, are such that many new applications are rendered feasible.