Dagwood
- 1 September 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 14 (3) , 218-240
- https://doi.org/10.1145/44128.214376
Abstract
We discuss the design, implementation, and benchmarking of a system that can manipulate symbolic expressions represented by their straight-line computations. Our system is capable of performing rational arithmetic on, evaluating, differentiating, taking greatest common divisors of, and factoring polynomials in straight-line format. The straight-line results can also be converted to standard, sparse format. We show by example that our system can handle problems for which conventional methods lead to excessive intermediate expression swell.Keywords
This publication has 15 references indexed in Scilit:
- Greatest common divisors of polynomials given by straight-line programsJournal of the ACM, 1988
- Factoring sparse multivariate polynomialsJournal of Computer and System Sciences, 1985
- Irreducibility of multivariate polynomialsJournal of Computer and System Sciences, 1985
- A note on the complexity of algebraic differentationInformation Processing Letters, 1978
- An improved multivariate polynomial factoring algorithmMathematics of Computation, 1978
- Sparse complex polynomials and polynomial reducibilityJournal of Computer and System Sciences, 1977
- A new approach to the symbolic factorization of multivariate polynomialsArtificial Intelligence, 1976
- Vermeidung von Divisionen.Journal für die reine und angewandte Mathematik (Crelles Journal), 1973
- Determining the Equivalence of Algebraic Expressions by Hash CodingJournal of the ACM, 1971
- Symbolic integrationCommunications of the ACM, 1971