Multiplication Hits the Speed Limit: A problem "around since antiquity" may have been resolved by a new algorithm.
The article discusses the development of an algorithm for whole number multiplication that may be the fastest such algorithm, developed by mathematics researchers Joris van der Hooven and David Harvey. According to the article, the algorithm involves the rounding of complex numbers within Fourier an...
| Published in: | Communications of the ACM Vol. 63; no. 1; pp. 11 - 14 |
|---|---|
| Main Author: | |
| Format: | Article |
| Published: |
Association for Computing Machinery
Jan2020
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |