Integer multiplication in time O(n log n)

Abstract : We present an algorithm that computes the product of two n-bit integers in O(n log n) bit operations.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-02070778
Contributor : Joris Van Der Hoeven <>
Submitted on : Monday, March 18, 2019 - 11:29:52 AM
Last modification on : Friday, April 12, 2019 - 1:31:46 AM

File

nlogn.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02070778, version 1

Citation

David Harvey, Joris Van Der Hoeven. Integer multiplication in time O(n log n). 2019. ⟨hal-02070778⟩

Share

Metrics

Record views

28366

Files downloads

121888