Balanced Dense Multivariate Multiplication: The General Case

2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)（2022）

引用 0|浏览5

暂无评分

摘要

We propose general preprocessing techniques to reshape dense multivariate polynomials over finite fields, in order to minimize the cost of memory accesses, while preserving sufficient parallelism, so as to reduce the running time of polynomial multiplication in multi-threaded implementations.

查看译文

关键词

Computer algebra, parallel computing

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要