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 |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=141677479&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 141677479 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Jan2020 vid: 63 iid: 1 pid: 68 pub: Association for Computing Machinery artinfo: ui: 141677479 10.1145/3371387 ppf: 11 ppct: 3 formats: tig: atl: Multiplication Hits the Speed Limit: A problem "around since antiquity" may have been resolved by a new algorithm. aug: au: Klarreich, Erica su: Algorithms Multiplication Fourier analysis Complex numbers sug: subj: Algorithms Multiplication Fourier analysis Complex numbers ab: 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. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2020 holdings: @attributes: islocal: N |
|---|