
arXiv: 1612.05778
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 advantages of this new approach.
Computer Science - Symbolic Computation, FOS: Computer and information sciences, Symbolic Computation (cs.SC), Symbolic computation, Cache complexity, Parallel processing, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Computer Science - Mathematical Software, Multi-core architectures, Polynomial algebra, Mathematical Software (cs.MS)
Computer Science - Symbolic Computation, FOS: Computer and information sciences, Symbolic Computation (cs.SC), Symbolic computation, Cache complexity, Parallel processing, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Computer Science - Mathematical Software, Multi-core architectures, Polynomial algebra, Mathematical Software (cs.MS)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
