@article{HarveyvanderHoeven:AM:2021,
    Author = {Harvey, David and van der Hoeven, Joris},
    File = {Integer multiplication in time O(n log n) - nlogn - a.pdf},
    Journal = {Annals of Mathematics},
    Keywords = {Complexity, FFT, integer multiplication},
    Number = {2},
    Pages = {563--617},
    Publisher = {Department of Mathematics of Princeton University},
    Title = {{Integer multiplication in time $O(n\mathrm{log}\, n)$}},
    URL = {https://doi.org/10.4007/annals.2021.193.2.4},
    Volume = {193},
    Year = {2021},
    bdsk-url-1 = {https://doi.org/10.4007/annals.2021.193.2.4},
    date-added = {2023-02-01 20:03:30 +0100},
    date-modified = {2023-02-01 20:04:07 +0100},
    doi = {10.4007/annals.2021.193.2.4}
}

@article{HarveyvanderHoeven:AM:2021, Author = {Harvey, David and van der Hoeven, Joris}, File = {Integer multiplication in time O(n log n) - nlogn - a.pdf}, Journal = {Annals of Mathematics}, Keywords = {Complexity, FFT, integer multiplication}, Number = {2}, Pages = {563--617}, Publisher = {Department of Mathematics of Princeton University}, Title = {{Integer multiplication in time $O(n\mathrm{log}\, n)$}}, URL = {https://doi.org/10.4007/annals.2021.193.2.4}, Volume = {193}, Year = {2021}, bdsk-url-1 = {https://doi.org/10.4007/annals.2021.193.2.4}, date-added = {2023-02-01 20:03:30 +0100}, date-modified = {2023-02-01 20:04:07 +0100}, doi = {10.4007/annals.2021.193.2.4} }