skip to main content
research-article
Free access

Multiplication hits the speed limit

Published: 20 December 2019 Publication History

Abstract

A problem "around since antiquity" may have been resolved by a new algorithm.

References

[1]
Fürer, M. Faster Integer Multiplication. SIAM J. Comput., Volume 39 Issue 3, 2009, pages 979-1005. http://bit.ly/2CFvmG6.
[2]
Harvey, D. and van der Hoeven, J. Integer Multiplication in Time O(nlogn). http://bit.ly/2QcOrr6.
[3]
Karatsuba, A. The Complexity of Computations. Proceedings of the Steklov Institute of Mathematics, Volume 211, 1995, pages 169-183. http://bit.ly/32M1oed.
[4]
Schönhage, A. and Strassen, V. Schnelle Multiplikation grosser Zahlen. Computing, Volume 7, Issue 3-4, September 1971, pages 281-292. https://link.springer.com/article/10.1007/BF02242355.

Cited By

View all
  • (2023)RExProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3668069(44925-44936)Online publication date: 10-Dec-2023
  • (2022)Embedding classical dynamics in a quantum computerPhysical Review A10.1103/PhysRevA.105.052404105:5Online publication date: 3-May-2022
  • (2020)iTrust—A Trustworthy and Efficient Mapping Scheme in Elliptic Curve CryptographySensors10.3390/s2023684120:23(6841)Online publication date: 30-Nov-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 63, Issue 1
January 2020
90 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/3377354
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 December 2019
Published in CACM Volume 63, Issue 1

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Popular
  • Pre-selected

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)355
  • Downloads (Last 6 weeks)42
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)RExProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3668069(44925-44936)Online publication date: 10-Dec-2023
  • (2022)Embedding classical dynamics in a quantum computerPhysical Review A10.1103/PhysRevA.105.052404105:5Online publication date: 3-May-2022
  • (2020)iTrust—A Trustworthy and Efficient Mapping Scheme in Elliptic Curve CryptographySensors10.3390/s2023684120:23(6841)Online publication date: 30-Nov-2020
  • (2020)Securely and Efficiently Computing the Hermite Normal Form of Integer Matrices via Cloud ComputingIEEE Access10.1109/ACCESS.2020.30119658(137616-137630)Online publication date: 2020

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media