Towards parallel general-size library generation for polynomial multiplication
Abstract
References
Index Terms
- Towards parallel general-size library generation for polynomial multiplication
Recommendations
Certain classes of polynomial expansions and multiplication formulas
The authors first present a class of expansions in a series of Bernoulli polyomials and then show how this general result can be applied to yield various (known or new) polynomial expansions. The corresponding expansion problem involving the Euler ...
Automatic Parallel Library Generation for General-Size Modular FFT Algorithms
CASC 2013: Proceedings of the 15th International Workshop on Computer Algebra in Scientific Computing - Volume 8136This paper presents the automatic library generation for modular FFT algorithms with arbitrary input sizes. We show how to represent the transform and its algorithms at a high abstraction level. Symbolic manipulations and code optimizations that use ...
Bivariate Polynomial Multiplication
FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer ScienceInspired by the discussion in [A. Schoenhage, Bivariate polynomial multiplication patterns, LNCS 948, 70-81, Springer, 1995], we study the multiplicative complexity and the rank of the multiplication in the local algebras $R_{m,n} = k[x,y]/(x^{m+1},y^{n+...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Column
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 45Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in