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)
Multivariate Polynomial Factorization
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Analysis of algorithms, a case study: Determinants of polynomials
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
ACM '73 Proceedings of the ACM annual conference
Algorithms for partial fraction decomposition and rational function integration
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
On square-free decomposition algorithms
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Newton's method: a great algebraic algorithm
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Algorithms for polynomial factorization.
Algorithms for polynomial factorization.
A p-adic division with remainder algorithm
ACM SIGSAM Bulletin
On the power series solution of a system of algebraic equations
ACM SIGSAM Bulletin
Constructive lifting in graded structures: A unified view of Buchberger and Hensel methods
Journal of Symbolic Computation
| Hi-index | 0.00 |
Machine computation of many algebraic operations of interest and utility to mathematicians and scientists has received increasing attention in the recent years. A variety of terminology has been used to describe this area of mathematical computation. Among these are symbolic manipulation, computer algebra, algebraic methods, constructive algebra, and seminumerical algorithms. Whatever name is chosen for the field currently known as symbolic and algebraic manipulation, the most fundamental part of any symbolic computer software system for the actual computing is always the workhorse subpackage that deals with polynomial and rational functions.