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.
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

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
Long-term archiving on : Wednesday, June 19, 2019 - 1:49:03 PM

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

49510

Files downloads

171126