Big Prime Field FFT on Multi-core Processors

DOI10.1145/3326229.3326273zbMath1467.65121OpenAlexW2959034228MaRDI QIDQ5120481

Linxiao Wang, Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza

Publication date: 10 September 2020

Published in: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-02191652/file/cmmw-2019.ISSAC.sigconf.pdf

zbMATH Keywords

fast Fourier transformsfinite fieldsmulti-core processorsgeneralized Fermat numbersIntel CilkPlusspecialized arithmetic

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (2)

Employing C++ Templates in the Design of a Computer Algebra Library ⋮ Computational schemes for subresultant chains

This page was built for publication: Big Prime Field FFT on Multi-core Processors