Algebraic simplification
Joel C. Moses · Communications of the ACM · 1971
Algebraic simplification is examined first from the point of view of a user who needs to comprehend a large expression, and second from the point of view of a designer who wants to construct a useful and efficient system. First we describe various techniques akin to substitution. These techniques can be used to decrease the size of an expression and make it more intelligible to a user. Then we delineate the spectrum of approaches to the design of automatic simplification capabilities in an algebraic manipulation system. Systems are divided into five types. Each type provides different facilities for the manipulation and simplification of expressions. Finally we discuss some of the theoretical results related to algebraic simplification. We describe several positive results about the existence of powerful simplification algorithms and the number-theoretic conjectures on which they rely. Results about the nonexistence of algorithms for certain classes of expressions are included.
Cited by 137 works. doi:10.1145/362637.362648 Open-access PDF
Authors
References
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- PM, a system for polynomial manipulation
- A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus
- Symbolic Integration
- The Problem of Integration in Finite Terms
- The MACSYMA system
- The Altran system for rational function manipulation — a survey
- Symbolic Mathematical Laboratory
- An Irreducibility Criterion for Polynomials Over the Integers