Space- and time-efficient polynomial multiplication

DOI10.1145/1576702.1576743zbMath1237.65151OpenAlexW2121228963MaRDI QIDQ2883831

Daniel S. Roche

Publication date: 13 May 2012

Published in: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical approximation and computational geometry (primarily algorithms) (65D99) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (1)

Impact of Intel's new instruction sets on software implementation of \(GF(2)[x\) multiplication]

This page was built for publication: Space- and time-efficient polynomial multiplication