| On computing with factored rational expressions |
| Full text |
Pdf
(684 KB)
|
| Source
|
ACM SIGSAM Bulletin
archive
Volume 8 , Issue 3 (August 1974)
table of contents
Pages: 26 - 34
Year of Publication: 1974
ISSN:0163-5824
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 5, Downloads (12 Months): 13, Citation Count: 7
|
|
|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
 |
2
|
|
| |
3
|
W. S. Brown, <u>ALTRAN User's Manual</u>, Third Edition, Bell Laboratories, 1973.
|
 |
4
|
|
 |
5
|
|
 |
6
|
|
 |
7
|
|
 |
8
|
|
 |
9
|
|
| |
10
|
David R. Musser, <u>Multivariate Polynomial Factorization</u>, to appear.
|
 |
11
|
|
CITED BY 7
|
|
|
|
|
|
|
|
|
|
|
J. Smit, A cancellation free algorithm, with factoring capabilities, for the efficient solution of large sparse sets of equations, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.146-154, August 05-07, 1981, Snowbird, Utah, United States
|
|
|
|
|
|
|
|
|
|
|