A Sorting Algorithm for Polynomial Multiplication
From MaRDI portal
Publication:4080722
DOI10.1145/321906.321908zbMath0318.68035OpenAlexW2044001533MaRDI QIDQ4080722
Publication date: 1975
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321906.321908
Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (2)
Dense polynomial multiplication with reduced array manipulation overhead ⋮ Sparse polynomial division using a heap
This page was built for publication: A Sorting Algorithm for Polynomial Multiplication