Complexity and performance results for non FFT-based univariate polynomial multiplication

DOI10.1145/1940475.1940484zbMATH Open1305.68348OpenAlexW2158950080MaRDI QIDQ5175243FDOQ5175243

Authors: Muhammad F. I. Chowdhury, Marc Moreno Maza, Wei Pan, Éric Schost 

Publication date: 20 February 2015

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1940475.1940484

Recommendations

• Parallel sparse polynomial multiplication on modern hardware architectures
• On fast multiplication of polynomials over arbitrary algebras
• Space- and time-efficient polynomial multiplication
• Parallel multiplication and powering of polynomials
• scientific article; zbMATH DE number 3856407

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)

Cited In (2)

• Cache complexity and multicore implementation for univariate real root isolation
• On the parallelization of subproduct tree techniques targeting many-core architectures

This page was built for publication: Complexity and performance results for non FFT-based univariate polynomial multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175243)