A fast, low-space algorithm for multiplying dense multivariate polynomials

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Vangalur S. Alagar Concordia Univ., Montreal, Que., Canada
David K. Probst Concordia Univ., Montreal, Que., Canada
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 13 Issue 1, March 1987
Pages 35-57
ACM New York, NY, USA
table of contents doi>10.1145/23002.27646
A fast, low-space algorithm for multiplying dense multivariate polynomials Published by ACM 1987 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 18
· Downloads (cumulative): 373
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder