The I/O complexity of Toom-Cook integer multiplication

DOI10.1137/1.9781611975482.123zbMath1432.68161OpenAlexW4251577892MaRDI QIDQ5236309

Lorenzo De Stefani, Gianfranco Bilardi

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.123

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: The I/O complexity of Toom-Cook integer multiplication