Complexity and performance results for non FFT-based univariate polynomial multiplication
From MaRDI portal
Publication:5175243
DOI10.1145/1940475.1940484zbMath1305.68348OpenAlexW2158950080MaRDI QIDQ5175243
Éric Schost, Muhammad F. I. Chowdhury, Marc Moreno Maza, Wei Pan
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
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)
This page was built for publication: Complexity and performance results for non FFT-based univariate polynomial multiplication