A Sorting Algorithm for Polynomial Multiplication

DOI10.1145/321906.321908MaRDI QIDQ4080722zbMATH OpenOpenAlexFDO

Authors Ellis Horowitz

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

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(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

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