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...
| Publicado en: | Communications of the ACM Vol. 63; no. 1; pp. 11 - 14 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Jan2020
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| Sumario: | 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 analysis in order to achieve precision and speed. |
|---|