On computing with factored rational expressions
- 1 August 1974
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 8 (3) , 26-34
- https://doi.org/10.1145/1086837.1086842
Abstract
This paper discusses the extension of an efficient polynomial manipulation system to deal with rational expressions. The proposed system is intended for a wide range of practical computations, including problems involving sparse expressions in many indeterminates.Keywords
This publication has 9 references indexed in Scilit:
- Sparse polynomial arithmeticACM SIGSAM Bulletin, 1974
- Factored rational expressions in ALTRANACM SIGSAM Bulletin, 1974
- Factoring multivariate polynomials over the integersACM SIGSAM Bulletin, 1973
- The EZ GCD algorithmPublished by Association for Computing Machinery (ACM) ,1973
- On the Problem of Recognizing ZeroJournal of the ACM, 1971
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- Algebraic simplificationCommunications of the ACM, 1971
- The Altran system for rational function manipulation — a surveyCommunications of the ACM, 1971
- On Canonical Forms and SimplificationJournal of the ACM, 1970