Harvey, David; van der Hoeven, Joris Polynomial multiplication over finite fields in time \(O(n\log n)\). (English) Zbl 1493.11157 J. ACM 69, No. 2, Article No. 12, 40 p. (2022). MSC: 11Y16 68M07 68W30 11T06 PDFBibTeX XMLCite \textit{D. Harvey} and \textit{J. van der Hoeven}, J. ACM 69, No. 2, Article No. 12, 40 p. (2022; Zbl 1493.11157) Full Text: DOI
van der Hoeven, Joris; Lecerf, Grégoire On the complexity exponent of polynomial system solving. (English) Zbl 1457.14002 Found. Comput. Math. 21, No. 1, 1-57 (2021). Reviewer: Vladimir P. Kostov (Nice) MSC: 14-04 14Q20 14B05 68W30 PDFBibTeX XMLCite \textit{J. van der Hoeven} and \textit{G. Lecerf}, Found. Comput. Math. 21, No. 1, 1--57 (2021; Zbl 1457.14002) Full Text: DOI HAL
Harvey, David; van der Hoeven, Joris Faster integer multiplication using plain vanilla FFT primes. (English) Zbl 1394.68182 Math. Comput. 88, No. 315, 501-514 (2019). MSC: 68Q25 11Y16 PDFBibTeX XMLCite \textit{D. Harvey} and \textit{J. van der Hoeven}, Math. Comput. 88, No. 315, 501--514 (2019; Zbl 1394.68182) Full Text: DOI arXiv
Harvey, David; van der Hoeven, Joris On the complexity of integer matrix multiplication. (English) Zbl 1395.68152 J. Symb. Comput. 89, 1-8 (2018). MSC: 68Q25 65F30 68W30 PDFBibTeX XMLCite \textit{D. Harvey} and \textit{J. van der Hoeven}, J. Symb. Comput. 89, 1--8 (2018; Zbl 1395.68152) Full Text: DOI HAL
Harvey, David; van der Hoeven, Joris; Lecerf, Grégoire Even faster integer multiplication. (English) Zbl 1350.68145 J. Complexity 36, 1-30 (2016). MSC: 68Q25 11Y16 65T50 68Q05 PDFBibTeX XMLCite \textit{D. Harvey} et al., J. Complexity 36, 1--30 (2016; Zbl 1350.68145) Full Text: DOI arXiv