Algebraic simplification
Author:
Open Access
- 1 August 1971
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 14 (8) , 527-537
Abstract
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.Keywords
This publication has 17 references indexed in Scilit:
- The Altran system for rational function manipulation — a surveyCommunications of the ACM, 1971
- The SAC-1 system1971
- REDUCE 21971
- The MACSYMA system1971
- The legacy of MATHLAB 681971
- On Canonical Forms and SimplificationJournal of the ACM, 1970
- REDUCE: A User-Oriented Interactive System for Algebraic Simplification1968
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- Experience with FORMAC algorithm designCommunications of the ACM, 1966
- PM, a system for polynomial manipulationCommunications of the ACM, 1966