SIGN IN
SIGN UP
Dagwood: a system for manipulating polynomials given by straight-line programs
Full Text:
PDF
Buy this Article
Authors:
Timothy S. Freeman
Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA
Gregory M. Imirzian
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY
Erich Kaltofen
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY
Lakshman Yagati
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY
1988 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 213
· Citation Count: 11
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 14 Issue 3, Sept. 1988
Pages 218-240
ACM
New York, NY
, USA
table of contents
doi>
10.1145/44128.214376
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
design
efficiency
factorization
implementation in lisp
implicit representation
measurement
multivariate polynomial
performance
program optimization
randomized algorithm
representations
special-purpose algebraic systems
straight-line program
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder