Parallel Integer Polynomial Multiplication

2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)(2016)

引用 6|浏览19
暂无评分
摘要
We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantage of this new approach.
更多
查看译文
关键词
Polynomial algebra,symbolic computation,parallel processing,cache complexity,multi-core architectures
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要